Related papers: Computing multiplicity sequences
Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…
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…
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…
We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…
We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…
We compute univariate and multigraded Hilbert series of invariants and covariants of representations of the circle and orthogonal group $\operatorname{O}_2$. The multigradings considered include the maximal grading associated to the…
We apply the method of spectral sequences to study classical problems in analysis. We illustrate the method by finding polynomial vector fields that commute with a given polynomial vector field and finding integrals of polynomial…
This note describes a package for computing seminormalization of rings within Macaulay2.
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
This paper gives the recursion formula for mixed multiplicities of maximal degrees with respect to joint reductions of ideals, which is one of important results in the mixed multiplicity theory. Using this result, we give consequences on…
We consider the degrees of the elements of a homogeneous system of parameters for the ring of invariants of a binary form, give a divisibility condition, and a complete classification for forms of degree at most 8.
Cohen Macaulay property of fiber cones of ideals is characterized in terms of its Hilbert series. Hilbert series of fiber cones of ideals with minimal mixed multiplicity is calculated. It is proved that the fiber cone of an m-primary ideal…
We describe the main functions of the Macaulay2 package Quasidegrees. The purpose of this package is to compute the quasidegree set of a finitely generated A-graded module presented as the cokernel of a monomial matrix. We provide examples…
Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes. As a result, the algorithm gives also a method to compute the integral cohomology ring…
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 study the Macaulay coefficients induced by the ideal and quotient segments of a degree-$\delta$ monomial in $n$ variables. We give explicit formulas for these coefficients and establish a duality between the two theories. Our main result…
We describe a significant update to the existing InvariantRing package for Macaulay2. In addition to expanding and improving the methods of the existing package for actions of finite groups, the updated package adds functionality for…
We introduce the package Posets for Macaulay2. This package provides a data structure and the necessary methods for working with partially ordered sets, also called posets. In particular, the package implements methods to enumerate many…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…