Related papers: Computing all minimal Markov bases in Macaulay2

We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.

Let $\mathcal{A}=\{{\bf a}_1,\ldots,{\bf a}_n\}\subset\Bbb{N}^m$. We give an algebraic characterization of the universal Markov basis of the toric ideal $I_{\mathcal{A}}$. We show that the Markov complexity of $\mathcal{A}=\{n_1,n_2,n_3\}$…

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

In this article, we describe the theoretical foundations of the Macaulay2 package ConnectionMatrices and explain how to use it. For a left ideal in the Weyl algebra that is of finite holonomic rank, we implement the computation of the…

In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…

We introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.

Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.

This article highlights the ToricHigherDirectImages package in Macaulay2. The central feature is a method for computing (higher) direct images of line bundles under surjective toric morphisms.

The Macaulay2 package CharacteristicClasses provides commands for the computation of the topological Euler characteristic, the degrees of the Chern classes and the degrees of the Segre classes of a closed subscheme of complex projective…

We introduce the $\textit{Macaulay2}$ package $\texttt{OIGroebnerBases}$ for working with OI-modules over Noetherian polynomial OI-algebras. The main methods implement OI-analogues of Buchberger's algorithm and Schreyer's theorem to compute…

This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…

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…

We introduce the package \texttt{EliminationTemplates} for the Macaulay2 computer algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent…

We introduce the Probability package for Macaulay2, which provides an interface for users to compute probabilities and generate random variates from a wide variety of univariate probability distributions.

We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…

The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…

In this article, we study monomial curves, toric ideals and monomial algebras associated to $4$-generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization for…

We introduce a package for doing tropical computations in Macaulay2. The package draws on the functionality of Gfan and Polymake while making the process as simple as possible for the end user. This provides a powerful and user friendly…

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…

We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…