GSoC Participation History
Technologies
Topics
Past Projects
Classification of Maximal Exceptional Sequences on Smooth Fano Toric Varieties
This project will enhance SageMath to systematically handle maximal exceptional sequences on smooth Fano toric varieties. We will add new Fano...
Poincaré normal form of Riemann matrices
The project aims to compute the Poincaré normal form of Riemann matrices in SageMath. This computation enables the decomposition of theta functions...
On the Implementation of the O(|E|⋅√|V|) Micali-Vazirani Algorithm
Matchings and perfect matchings have received considerable attention in graph theory as well as in other related domains (such as, but not limited...
The Boson-Fermion Correspondence and Vertex Operators
The boson-fermion correspondence is an isomorphism of two representations of the Heisenberg algebra. It can be stated as a way to construct a special...
Functionalities for Krylov methods over exact fields
This project aims to add Krylov subspace methods for matrices over exact fields: representation of the kernel, co-kernel of a matrix of univariate...
Paths and cycles enumeration methods in graphs
This project focuses on enumeartion of k shotest simple paths. This problem has practical applications in various networks, such as road and...
Self Paired Hopf Algebra on Double Posets
This project implements the combinatorial Hopf algebra of double posets. A double poset is a set with two partial orders, and their isomorphism...
Frequently Asked Questions
SageMath | GSoC Org Profile & Stats - Learn about SageMath's involvement in Google Summer of Code (GSoC), their technologies, detailed reports.
Participation
Projects
Top Programming Languages
Project Difficulty Distribution
No difficulty data available
Built with ❤️ for the Google Summer of Code (GSoC) open source community | © 2026 GSoCOrganizationsGuide