Related papers: Computing multiplicity sequences
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 describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…
The \texttt{StronglyStableIdeals} package for \textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary…
We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2. This package implements many data types, objects and algorithms which pertain to, among other things, filtered complexes,…
We consider the notion of mixed multiplicities for multigraded modules by using Hilbert series, and this is later applied to study the projective degrees of rational maps. We use a general framework to determine the projective degrees of a…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
This paper investigates the relationship between multiplicities and the degree sequence of ideals in graded algebras, gives multiplicity equations of graded rings via the degree sequence of ideals, and characterizes mixed multiplicities and…
We present a package 'MixedMultiplicity' for computing mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over a field. This enables us to find mixed volumes of convex lattice polytopes…
We introduce the Macaulay2 package $\mathtt{LinearTruncations}$ for finding and studying the truncations of a multigraded module over a standard multigraded ring that have linear resolutions.
We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.
This article investigates the computational aspects of the $\varepsilon$-multiplicity. Primarily, we show that the $\varepsilon$-multiplicity of a homogeneous ideal $I$ in a two-dimensional standard graded domain of finite type over an…
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…
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…
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.
The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also introduces new objects, Sample and Model, to allow for…
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…