Related papers: Strongly stable ideals and Hilbert polynomials

We give an explicit formula for the Hilbert-Poincar\'{e} series of the parity binomial edge ideal of a complete graph $K_{n}$ or equivalently for the ideal generated by all $2\times 2$-permanents of a $2\times n$-matrix. It follows that the…

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 consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

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.

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

Gaussian radial basis functions can be an accurate basis for multivariate interpolation. In practise, high accuracies are often achieved in the flat limit where the interpolation matrix becomes increasingly ill-conditioned. Stable…

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

Let $(A,\mathfrak m)$ be an excellent two-dimensional normal local domain. In this paper we study the elliptic and the strongly elliptic ideals of $A$ with the aim to characterize elliptic and strongly elliptic singularities, according to…

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…

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

In the paper we give an upper bound for the Waldschmidt constants of the wide class of ideals. This generalizes the result obtained by Dumnicki, Harbourne, Szemberg and Tutaj-Gasinska, Adv. Math. 2014. Our bound is given by a root of a…

We compute the cone of effective divisors on the Hilbert scheme of points in the projective plane. We show the sections of many stable vector bundles satisfy a natural interpolation condition, and that these bundles always give rise to the…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…

We call the scheme parameterizing homogeneous ideals with fixed initial ideal the Gr\"obner scheme. We introduce a Bia{\l}ynicki-Birula decomposition of the Hilbert scheme $\mathrm{Hilb}^{P}_n$ for any Hilbert polynomial $P$ such that the…

We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.

We introduce a new Macaulay 2 package, SimplicialDecomposability, which works in conjunction with the extant package SimplicialComplexes in order to compute a shelling order, if one exists, of a specified simplicial complex. Further,…

This paper proposes an unconditionally stable numerical method for solving a nonlinear Sobolev model with distributed delay. The proposed computational approach approximates the time derivative by interpolation technique whereas the spatial…

Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial…

Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…

We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference…