Related papers: Numerical Hilbert functions for Macaulay2
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
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…
This paper describes the RationalMaps package for Macaulay2. This package provides functionality for computing several aspects of rational maps such as whether a map is birational, or a closed embedding.
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…
The Macaulay2 package PHCpack.m2 provides an interface to PHCpack, a general-purpose polynomial system solver that uses homotopy continuation. The main method is a numerical blackbox solver which is implemented for all Laurent systems. The…
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.…
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.
In this paper, we present an algorithm for computing the minimal reductions of $\mathfrak{m}$-primary ideals of Cohen--Macaulay local rings. Using this algorithm, we are able to compute the Hilbert--Samuel multiplicities and solve the…
We compute the completion of the local ring of the Hilbert scheme of degree $n+1$ subschemes of $\mathbb{A}^n$ at the point corresponding to the ideal $\langle x_1,\ldots,x_n\rangle^2$, and describe the completion of the universal family.…
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 study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
This paper is a survey on major results on Hilbert functions of multigraded algebras and mixed multiplicities of ideals, including their applications to the computation of Milnor numbers of complex analytic hypersurfaces with isolated…
The package \texttt{NumericalCertification} implements methods for certifying numerical approximations of solutions for a given system of polynomial equations. For certifying regular solutions, the package implements Smale's $\alpha$-theory…
We describe the Macaulay2 package "A1BrouwerDegrees" for computing local and global $\mathbb{A}^1$-Brouwer degrees and studying symmetric bilinear forms over the complex numbers, the real numbers, the rational numbers, and finite fields of…
We present {\tt RandomPoints}, a package in \emph{Macaulay2} designed mainly to identify rational and geometric points in a variety over a finite field. We provide tools to estimate the dimension of a variety. We also present methods to…
We present a new approach to the study of multiplier ideals in a local, two-dimensional setting. Our method allows us to deal with ideals, graded systems of ideals and plurisubharmonic functions in a unified way. Among the applications are…
We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…
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…
A primary ideal in a polynomial ring can be described by the variety it defines and a finite set of Noetherian operators, which are differential operators with polynomial coefficients. We implement both symbolic and numerical algorithms to…
We introduce the MatrixSchubert package for the computer algebra system Macaulay2. This package has tools to construct and study matrix Schubert varieties and alternating sign matrix (ASM) varieties. The package also introduces tools for…