The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.
-
Updated
Jun 6, 2024 - Macaulay2
The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.
A Sage interface for FGb (Gröbner basis computations)
Library for Polynomial System Solving through Algebraic Methods
Groebner bases in (almost) pure Julia
General-Purpose Computer Algebra System as an EDSL in Haskell
Rings: efficient JVM library for polynomial rings
A javascript library to work with polynomials in Q and multiple variables.
An easy-to-use, general and open-source tool to search for guess-and-determine attacks and key bridges
Advanced Combinatorics and Algebraic Number Theory Symbolic Computation library for JavaScript, Python
c++ programs on groebner basis and polynomial ideals computation
A SageMath interface for M4GB.
An educational purposes repository with algorithms for solving SAT problems with Groebner Bases.
Testbed for exploring dynamic algorithms to compute a Groebner basis
Buchberger's algorithm in Common Lisp. Moved to https://git.sr.ht/~jmbr/cl-buchberger
Groebner basis university project
A one-person game that visualizes Buchberger's algorithm to find the reduced Gröbner basis of a set of binomials over ℤ₂[𝑥,𝑦]
Explain Buchberger's algorithm by using Singular as a backend
Utility for computing boolean Groebner bases with involutive Pommaret algorithm
Add a description, image, and links to the groebner-basis topic page so that developers can more easily learn about it.
To associate your repository with the groebner-basis topic, visit your repo's landing page and select "manage topics."