Related papers: The OIGroebnerBases Package for Macaulay2
Given a sequence of related modules $M_n$ defined over a sequence of related polynomial rings, one may ask how to simultaneously compute a finite Gr\"obner basis for each $M_n$. Furthermore, one may ask how to simultaneously compute the…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
The complexity of Gr\"{o}bner computations has inspired many improvements to Buchberger's algorithm over the years. Looking for further insights into the algorithm's performance, we offer a threaded implementation of classical Buchberger's…
We describe a recently revived version of the software package SubalgberaBases, which is distributed in the Macaulay2 computer algebra system. The package allows the user to compute and manipulate subagebra bases -- which are also known as…
We give an overview of a Macaulay2 package for computing with the multigraded BGG correspondence. This software builds on the package BGG due to Abo-Decker-Eisenbud-Schreyer-Smith-Stillman, which concerns the standard graded BGG…
In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…
We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…
The Macaulay2 package NumericalSchubertCalculus provides methods for the numerical computation of Schubert problems on Grassmannians. It implements both the Pieri homotopy algorithm and the Littlewood-Richardson homotopy algorithm. Each…
A supplemental paper detailing the QuillenSuslin package for Macaulay2. The QuillenSuslin package for Macaulay2 provides the ability to compute a free basis for a projective module over a polynomial ring with coefficients in Q, Z or Z/p for…
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
We describe a software package for constructing minimal free resolutions of GL_n(Q)-equivariant graded modules M over Q[x_1, ..., x_n] such that for all i, the ith syzygy module of M is generated in a single degree. We do so by describing…
We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…
We introduce the Macaulay2 package SCMAlgebras. It provides functions for computing the modules of deficiency and the filter ideals, in order to check whether a module or an ideal is sequentially Cohen-Macaulay. After the basic algebraic…
In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…
We introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay $H$-bases to suitably graded modules over a commutative graded $\mathbf{k}$-algebra, where the index sets of the two gradings may differ.…
Finitely generated modules over the polynomial ring in $n$ indeterminates are isomorphic to quotients of finite rank free modules. We introduce a theory of relative Gr\"obner bases for those quotients of free modules and, equivalently, for…