相关论文: Normalization of monomial ideals and Hilbert funct…

Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9.…

In this article, we prove a normality criterion for a family of meromorphic functions having zeros with some multiplicity which involves sharing of a holomorphic function by the members of the family. Our result generalizes Montel's…

We study birational maps with empty base locus defined by almost complete intersection ideals. Birationality is shown to be expressed by the equality of two Chern numbers. We provide a relatively effective method of their calculation in…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

We prove a characterization of the j-multiplicity of a monomial ideal as the normalized volume of a polytopal complex. Our result is an extension of Teissier's volume-theoretic interpretation of the Hilbert-Samuel multiplicity for m-primary…

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…

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…

Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…

Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…

In the last decade, the approximate basis computation of vanishing ideals has been studied extensively in computational algebra and data-driven applications such as machine learning. However, symbolic computation and the dependency on term…

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…

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 consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…

Let $k$ be a field and $x,y$ indeterminates over $k$. Let $R=k[x^a,x^{p_1}y^{s_1},\ldots,x^{p_t}y^{s_t},y^b] \subseteq k[x,y]$. We calculate the Hilbert polynomial of $(x^a,y^b)$. The multiplicity of this ideal provides part of a criterion…

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

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…

It remains an open problem to classify the Hilbert functions of double points in $\mathbb{P}^2$. Given a valid Hilbert function $H$ of a zero-dimensional scheme in $\mathbb{P}^2$, we show how to construct a set of fat points $Z \subseteq…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…