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

Normaliz is a tool for the computation of Hilbert bases of normal affine monoids and related tasks. We describe the Macaulay 2 interface to Normaliz. It makes Normaliz accessible for operations on monoid algebras in Macaulay 2 and,…

In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a…

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of…

We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…

We introduce the the normal reduction number of two-dimensional normal singularities and prove that elliptic singularity has normal reduction number two. We also prove that for a two-dimensional normal singularity which is not rational, it…

We give explicit formulas for the Bhattacharya function of m-primary complete monomial ideals in two variables in terms of the vertices of the Newton polyhedra or in terms of the decompositions of the ideals as products of simple ideals.

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

The Koszul homology of modules of the polynomial ring $R$ is a central object in commutative algebra.It is strongly related with the minimal free resolution of these modules, and thus with regularity, Hilbert functions, etc. Here we…

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

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…

Let $R = K[x_1, x_2, x_3, x_4]$ be the polynomial ring over a field of characteristic zero. For the ideal $(x_1^a, x_2^b, x_3^c, x_4^d) \subset R$, where at least one of $a$, $b$, $c$ and $d$ is equal to two, we prove that its generic…

We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…

Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…

In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

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…