Related papers: Strongly stable ideals and Hilbert polynomials

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…

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…

In this paper we study the index of reducibility of powers of a standard parameter ideal. An explicit formula is proved for the extremely case. We apply the main result to compute Hilbert polynomials of socle ideals of standard parameter…

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…

Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the…

We follow a polynomial approach to analyse strong stability of linear difference equations with rationally independent delays. Upon application of the Hermite stability criterion on the discrete-time homogeneous characteristic polynomial,…

We characterize all Gorenstein rings generated by strongly stable sets of monomials of degree two. We compute their Hilbert series in several cases, which also provides an answer to a question by Migliore and Nagel.

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\mathrm{deg}\ x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form…

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.

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.

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…

We define marked sets and bases over a quasi-stable ideal $\mathfrak j$ in a polynomial ring on a Noetherian $K$-algebra, with $K$ a field of any characteristic. The involved polynomials may be non-homogeneous, but their degree is bounded…

We find an explicit formula for the elliptic stable envelope in the case of the Hilbert scheme of points on a complex plane. The formula has a structure of a sum over trees in Young diagrams. In the limit we obtain the formulas for the…

A system of partial differential equations describing the spatial oscillations of an Euler-Bernoulli beam with a tip mass is considered. The linear system considered is actuated by two independent controls and separated into a pair of…

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 note presents the multivariate Hermite criterion: a practical and powerful algorithm for determining the number of distinct real and complex roots of a zero-dimensional system of polynomials in any finite number of variables. The final…

We give two algorithms for computing the Hilbert depth of a \emph{graded ideal} in the polynomial ring. These algorithms work efficiently for (squarefree) lex ideals. As a consequence, we construct counterexamples to some conjectures made…

We introduce a new class of monomial ideals, called strong Borel type ideals, and we compute the Mumford-Castelnouvo regularity for principal strong Borel type ideals. Also, we describe the d-fixed ideals generated by powers of variables…

Macaulay's theorem and Fr\"oberg's conjecture deal with the Hilbert function of homogeneous ideals in polynomial rings $S$ over a field $K$. In this short note we present some questions related to variants of Macaulay's theorem and…