GSoC 2026 Proposal: Interface combinatorial species and Usain-Boltz

[Joseph Jung]

Hi Martin,

My name is Joseph, and I am putting together a GSoC proposal for the 90-hour Usain-Boltz interfacing project.

I’ve been getting familiar with the SageMath workflow and recently had my first PR merged resolving an issue in sage.combinat.root_system (https://github.com/sagemath/sage/pull/41909). My primary background is in competitive math (USAMO), so I have a very strong foundation in discrete math, generating functions, and recursive logic, which drew me directly to this project.

I am finalizing my technical implementation plan this weekend. Before I submit the draft, I wanted to ask: For the method that computes the grammar for species, are there specific operations (like substitution or pointing) that you see as the biggest bottlenecks for translating into the Usain-Boltz format?

Thanks for your time,

Joseph Jung

[Martin R]

Hi Joseph!

In the end we are going to provide a grammar whenever we can, but only some will be usable by Usain Boltz.  In particular, only substitutions of set species and possibly cycle species with other species will be supported.