GSoC 2026 Introduction - Luka Aladashvili (Polynomial GCD / Floating Point Optimization)

[Luka Aladashvili]

Hi,

I’m Luka, a Mathematics and Computer Science student from the Free University of Tbilisi. I am planning to apply for GSoC 2026, and I wanted to introduce myself to the community.

I previously spent some time working on the codebase, which gave me a great introduction to SymPy’s testing infrastructure and workflow.

Given my background as an ICPC Northern Eurasia Finalist and a Top 0.01% National Math Champion, as well as my experience building high-performance C++ engines, I am very interested in the more algorithmic projects this year. Specifically, I am looking closely at:

1. Polynomial GCD (sparse representation algorithms)

2. Optimize Floating Point Expressions

To get back into the swing of things, are there any specific open issues related to sparse polynomials or floating-point evaluation that you would recommend I tackle? I’d like to solve a relevant issue to help me start drafting a realistic project proposal.

Thank you for your time and guidance!

Best, 

Luka Aladashvili

Github: https://github.com/llukito