The primary source code repository for Macaulay2, a system for computing in commutative algebra, algebraic geometry and related fields.

The agda-unimath library

Rings: efficient JVM library for polynomial rings

A software package for algebraic, geometric and combinatorial problems on linear spaces. By R. Hemmecke, R. Hemmecke, M. Köppe, P. Malkin, M. Walter

An introduction to the basic ideas of commutative algebra

A computer algebra system in Smalltalk

Field-algebra based on Group / Ring symbolic vector module extension

A curated list of Algebraic Statistics tools and resources.

Macaulay2 package for computing invariants of group actions on polynomial rings

Equivalent definitions of flatness

In this project, we attempt to reformulate various notions from classical commutative algebra (such as flatness, regularity, smoothness, etc.) in an entirely categorical manner, so as to be able to later write down their analogues in derived algebraic geometry without having to develop extra theory. We will also be presenting certain application…

c++ library for mathematical computations

Computation using Sympy to understand Spin Algebra

A combinatorial procedure for computing prolongation kernels

Programs and examples of computations of schemes evinced by generalized additive decompositions (GADs)

Notes on the derived functor \Ext^i(-,-)

Formalization of faithfully flat descent of projectivity and Mittag-Leffler modules in Lean 4.

An experimental, companion implementation of the Macaulay2 computer algebra system in Rust.

Lean formalized proof of a bound on the minimal number of generators of a product of ideals.