Gabow Arborescence Packing In SageMath
Contributor: Dogukan Bingol
Edge-disjoint spanning arborescences are a fundamental structure in directed graph theory, with applications in connectivity and network design....
Science and medicine
SageMath
Open-source mathematics software system
Technologies
cythonPython
Topics
educationmathematicsresearch
- Total projects
- 58
- Years participating
- 11
- Most recent
- 2026
Participation history
Historical projects
Integrating FLINT/Calcium Algebraic Number Fields as a Backend for SageMath's AA and QQbar.
Contributor: Madhu Sripada
Problem: SageMath's algebraic number fields (AA/QQbar) have performance bottlenecks in equality testing, arithmetic on high-degree numbers, and...
Improve and Polish the Generation of Structures of Combinatorial Species
Contributor: Parth Chavan
SageMath's LazyCombinatorialSpecies framework (sage/rings/lazy_species.py) represents combinatorial species as lazy sequences of symmetric-group...
Add Supersymmetric Functions and Bases
Contributor: Shriya Meenakshisundaram
SageMath currently has various examples of Hopf Algebras implemented, such as symmetric functions, quasisymmetric functions, word-quasisymmetric...
Poincaré normal form of Riemann matrices
Contributor: Caleb Aryee
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
Contributor: Janmenjaya Panda
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
Contributor: Joe McDonough
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
Contributor: Nicholas Bell
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
Contributor: Yuta
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
Contributor: Yuxuan Sun
This project implements the combinatorial Hopf algebra of double posets. A double poset is a set with two partial orders, and their isomorphism...
On Decompositions, Generation Methods and related concepts in the theory of Matching Covered Graphs
Contributor: Janmenjaya Panda
Matchings and perfect matchings have received considerable attention in graph theory as well as in other related domains (such as, but not limited...
Implementation of Tropical Polynomials and its Corresponding Tropical Hypersurfaces
Contributor: Verrel Rievaldo Wijaya
In tropical algebra, where addition resembles taking the maximum and multiplication is like regular addition, tropical polynomials come into play....
Expanding SageMath’s Dynamical systems capabilities
Contributor: NateBolin
I'm Nate Bolin a mathematics graduate student, and I'm working with my mentor Benjamin Hutz to Expand the Dynamical Systems capabilities of Sagemath....
Tensor operations in Sage using Python libraries as backends
Contributor: Aman Moon
In SageMath, tensors are presently stored within the Components class as a dictionary, with each key representing indices and values indicating the...
Improving combinatorial species
Contributor: Mainak Roy
Sage already has a working implementation of combinatorial species, but it is old, ad-hoc, and not entirely generic. This project aims to reimplement...
Direct Implementation of Chow Rings of Matroids
Contributor: Shriya Meenakshisundaram
This Google Summer of Code project aims to build a custom class in SageMath for the Chow rings of matroids by using a result which explicitly...
Parameterizing invariant spaces
Contributor: Bruno Edwards
I've been working on extending SageMath's capabilities to calculate parameterizations for invariant rings of matrix groups over finite fields. While...
Dynamical Systems with Multiple Functions
Contributor: Dang
Sage does not have support for dynamical semigroups, which are dynamical systems involving multiple functions. This project aims to create a class...
Algorithms for Dynamical Systems
Contributor: Jing Guo
The goals of this project is to implement two algorithmic improvements for Sage: 1) Improve current implementation of Krumm's algorithms for points...
Enhancements in linear algebra
Contributor: Marie B
Sage incorporates state-of-the-art libraries for exact linear algebra computations, such as matrix multiplication, reduced echelon form, linear...
Implementing functions from toric topology
Contributor: Ognjen Petrov
The aim of this project is to further expand Sage's library for topology, by implementing various functions from toric topology. Though this field...
Enhanced optimization solver interfaces for Sage
Contributor: Zhongling Xu
This project aims at improving the optimization capabilities of SageMath by connecting SageMath to interfaces to optimization solvers that are...
2022 GSoC Implement piecewise functions of one or several variables Proposal
Contributor: Nicole Li
In this project, we aim to implement piecewise function on the polyhedral complex for general purpose for SageMath. Generally, this project should...
Improve Height Functionality
Contributor: Jing Guo
The goals of this project are to fix and improve current implementations of height functionalities, and to implement the Arakelov-Zhang pairing of...
Edge connectivity and edge disjoint spanning trees in digraphs
Contributor: cgeorgia
The current method used for finding edge disjoint spanning trees in directed graphs (digraphs) relies on mixed integer linear programming and it may...
Edge connectivity and edge disjoint spanning trees in digraphs
Contributor: c1e0
The current method used for finding edge disjoint spanning trees in directed graphs fails in some instances. The goal of this project is to implement...
Rewrite exterior algebra, implement Groebner bases, and peelable tableaux for northwest diagrams
Contributor: Trevor Karn
An exterior algebra E is a mildly non-commutative algebra with fundamental applications in physics and geometry. The first goal of this project is to...
Implement Small Groups
Contributor: Alexis Newton
The goal of this project is to improve the conversation between Sage and GAP (the SmallGrp package). We want to create convenient ways for...
G-invariants of the Orlik-Solomon and Orlik-Terao algebras
Contributor: Trevor Karn
For a finite-dimensional algebra A equipped with the action of a group G, the invariant algebra A^G has many useful interpretations in topology and...
Add support for error terms with explicit constants to AsymptoticRing
Contributor: Thomas Hagelmayer
An asymptotic expression typically contains exact terms and O-terms, for example n3 + 2n2 + O(n). The basic framework for this asymptotic ring is...
Lazy Formal Power Series
Contributor: Tejasvi Chebrolu
A formal power series is a (potentially) infinite sequence of coefficients. It turns out to be practical to denote it as an infinite series, although...
Implementation of the graded ring of quasimodular forms
Contributor: David Ayotte
The goal of this project is twofold: first, we wish to implement the graded ring of quasimodular forms and, second, we wish to implement the...
Dynamics Algorithmic Improvements
Contributor: Alexander Galarraga
We aim to improve several computations in dynamics and also implement new features. Improvements include optimizing the automorphic group...
Rigorous integration and the Abel-Jacobi map
Contributor: Linden Disney-Hogg
Riemann surfaces are key objects in many areas of maths, from mathematical physics to algebraic and arithmetic geometry. As such there is...
Integration of Kenzo program with SimplicialSets
Contributor: Julian Cuevas-Rozo
In this project we pretend to continue with the integration of the Kenzo program and SageMath. Specifically, we propose to combine the functions and...
Constructing a database of distance-regular graphs
Contributor: Ivo
This project aims to construct a database of distance-regular graphs in SageMath.
Efficiently Counting Linear Extensions of Posets
Contributor: Stefan Grosser
Linear extensions of partially ordered sets are fundamental in order theory and in algebraic combinatorics, holding high importance in the study of...
Berkovich Project Line
Contributor: Alexander Galarraga
The goal of this project is to implement the Berkovich projective line in Sage, along with dynamical systems acting the Berkovich projective line. If...
Efficient methods for Diameter, radius and all eccentricities computations
Contributor: Vipul Gupta
Currently, the algorithms for Radius, Diameter, and all eccentricities calculations in SageMath are too brute and hence too slow. They involve...
Enumeration of paths and improvements in the Graph Module
Contributor: Rajat Mittal
This project aims to implement an iterator over k- shortest source to destination paths using improved versions of Yen’s algorithm for simple paths....
Improvements of the graph module
Contributor: Giapitzakis Tzintanos G.
This project consists of the following parts: Cythonize current methods Improve graph traversals and add new ones
Rank Metric McEliece Cryptosystem
Contributor: Marketa Slukova
Implement necessary tools for rank metric McEliece cryptosystems. Namely finish work on rank metric and Gabidulin codes (tickets #21226 and #20970)....
Refactor RSK and implement new insertion rules
Contributor: Chaman Agrawal
The Robinson-Schensted-Knuth (RSK) correspondence is a generalization of the famous Robinson-Schensted (RS) correspondence and plays an important...
Databases and bounds of codes
Contributor: Filip Ion
The following proposal detail some possible improvements of the coding theory component of SageMath. We aim to build databases of precomputed bounds...
Rational Point on Varieties
Contributor: Raghukul Raman
This project aims at implementing basic algorithms for finding rational points on varieties. Classically algebraic variety is defined as the set of...
Addition of SPQR-tree to graph module
Contributor: Sai Harsh Tondomker
In this project, our goal is to extend the graph theory library in Sage by implementing functionality to find triconnected subgraphs, which will...
Addition of SPQR-trees to the graph module of Sage Math
Contributor: Meghana M Reddy
The aim of the project is to code the linear time algorithm for partitioning a graph into 3-connected components and constructing the corresponding...
Checking graph isomorphism using the Weisfeiler-Lehman algorithm
Contributor: Dario Asprone
Currently SageMath checks for graph isomorphism through an internal package with a corresponding method, called isomorphic and contained in...
Implementing matroid classes and plotting improvements
Contributor: Zachary Gershkoff
This project seeks to implement several common matroid classes in SageMath, along with algorithms for their display and relevant computations. The...
Expanding the Functionality of Dynamical Systems
Contributor: Rebecca Lauren Miller
As a member of the sage-dynamics community, researchers have compiled a wishlist for algorithms and functionality they would like added. I would like...
Improvement of Complex Dynamics in Sage
Contributor: Ben Barros
There are three major things that I would like to implement to improve the functionality of Sage in the area Complex Dynamics. By the conclusion of...
Modular Decomposition of graphs and digraphs
Contributor: Maria Ioanna Spyrakoy
Modular decomposition of (di)graphs is a generalization of the concept of the decomposition of (di)graphs into connected components. Its current...
Linear-time Implementation of Modular Decomposition of Undirected and Directed Graphs
Contributor: Lokesh Jain
This project is aimed at providing linear time implementation for modular decomposition of graphs and digraphs. Modular decomposition is...
Rank Metric Codes in Sage
Contributor: arpitdm
In this project, our goal is to extend the Coding Theory library in Sage by implementing base classes for linear rank-metric codes and Gabidulin...
Moduli Space of Dynamical Systems
Contributor: Rebecca Lauren Miller
There is functionality for working with dynamical systems over projective space in Sage. However, one of the areas lacking in functionality is the...
Expand the generic algebraic curve functionality in Sage
Contributor: gjorgenson
The aim of this project is to build on the functionality Sage has for algebraic curves. The primary topics for this expansion are intersection...
Extending Matroid Theory functionality
Contributor: Tara
The goal is to improve the functionality of the matroid package in terms of usefulness to researchers. In particular, we plan on the following. We...
Modular Abelian Variety
Contributor: klui
There are several key features missing in Sage for modular abelian varieties. The goal of this project is to implement as much as possible. I will...