Searcharxiv⌕ Search

arXiv subjects

Jürgen Herzog

Publications and source records attributed to Jürgen Herzog.

106 records · Page 6Linked to original sources

Ordinary and symbolic powers are Golod

Let $S$ be a positively graded polynomial ring over a field of characteristic 0, and $I\subset S$ a proper graded ideal. In this note it is shown that $S/I$ is Golod if $\partial(I)^2\subset I$. Here $\partial(I)$ denotes the ideal generated by all the partial derivatives of elements of $I$. We apply this result to find large classes of Golod ideals, including powers, symbolic powers, and saturations of ideals.

math.AC↗

Powers are Golod

Let $I$ be a proper graded ideal in a positively graded polynomial ring $S$ over a field of characteristic 0. In this note it is shown that $S/I^k$ is Golod for all $k\geq 2$.

math.AC↗

Bounds for the regularity of local cohomology of bigraded modules

Let $M$ be a finitely generated bigraded module over the standard bigraded polynomial ring $S=K[x_1,...,x_m, y_1,...,y_n]$, and let $Q=(y_1,...,y_n)$. The local cohomology modules $H^k_Q(M)$ are naturally bigraded, and the components $H^k_Q(M)_j=\Dirsum_iH^k_Q(M)_{(i,j)}$ are finitely generated graded $K[x_1,...,x_m]$-modules. In this paper we study the regularity of $H^k_Q(M)_j$, and show in several cases that $\reg H^k_Q(M)_j$ is linearly bounded as a function of $j$.

math.AC↗

Squarefree monomial ideals with constant depth function

In this paper we study squarefree monomial ideals which have constant depth functions. Edge ideals, matroidal ideals and facet ideals of pure simplicial forests connected in codimension one with this property are classified.

math.AC↗

Persistence and stability properties of powers of ideals

We introduce the concept of strong persistence and show that it implies persistence regarding the associated prime ideals of the powers of an ideal. We also show that strong persistence is equivalent to a condition on power of ideals studied by Ratliff. Furthermore, we give an upper bound for the depth of powers of monomial ideals in terms of their linear relation graph, and apply this to show that the index of depth stability and the index of stability for the associated prime ideals of polymatroidal ideals is bounded by their analytic spread.

math.AC↗

Monomial localizations and polymatroidal ideals

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree monomial ideals where it is equivalent to a well-known characterization of matroids. We prove our conjecture in many other special cases. We also introduce the concept of componentwise polymatroidal ideals and extend several of the results, known for polymatroidal ideals, to this new class of ideals.

math.AC↗

Expansions of monomial ideals and multigraded modules

We introduce an exact functor defined on multigraded modules which we call the expansion functor and study its homological properties. The expansion functor applied to a monomial ideal amounts to substitute the variables by monomial prime ideals and to apply this substitution to the generators of the ideal. This operation naturally occurs in various combinatorial contexts.

math.AC↗

The binomial edge ideal of a pair of graphs

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gröbner basis and characterize unmixedness and Cohen--Macaulayness.

math.AC↗

The stable set of associated prime ideals of a polymatroidal ideal

The associated prime ideals of powers of polymatroidal ideals are studied, including the stable set of associated prime ideals of this class of ideals. It is shown that polymatroidal ideals have the persistence property and for transversal polymatroids and polymatroidal ideals of Veronese type the index of stability and the stable set of associated ideals is determined explicitly.

math.AC↗

Finite lattices and Gröbner bases

Gröbner bases of binomial ideals arising from finite lattices will be studied. In terms of Gröbner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.

math.AC↗

Homology of powers of ideals: Artin--Rees numbers of syzygies and the Golod property

For an ideal I in a regular local ring (R,m)$ with residue class field K = R/m or a standard graded K-algebra R we show that for k >> 0 --> the Artin--Rees number of the syzygy modules of I^k as submodules of the free modules from a free resolution is constant, and thereby present the Artin-Rees number as a proper replacement of regularity in the local situation, --> the ring R/I^k is Golod, its Poincer{é}-Betti series is rational and the Betti numbers of the free resolution of K over R/I^k are polynomials in k of a specific degree. The first result is an extension of work of Kodiyalam and Cutkosky, Herzog & Trung on the regularity of I^k for k >> 0 from the graded situation to the local situation. The polynomiality consequence of the second result is an analog of work by Kodiyalam on the behavior of Betti numbers of the minimal free resolution of R/I^k over R.

math.AC↗

Stanley depth and size of a monomial ideal

Lyubeznik introduced the concept of size of a monomial ideal and showed that the size of a monomial ideal increased by $1$ is a lower bound for its depth. We show that the size is also a lower bound for its Stanley depth. Applying Alexander duality we obtain upper bounds for the regularity and Stanley regularity of squarefree monomial ideals.

math.AC↗

How to compute the Stanley depth of a monomial ideal

Let $J\subset I$ be monomial ideals. We show that the Stanley depth of $I/J$ can be computed in a finite number of steps. We also introduce the $\fdepth$ of a monomial ideal which is defined in terms of prime filtrations and show that it can also be computed in a finite number of steps. In both cases it is shown that these invariants can be determined by considering partitions of suitable finite posets into intervals.

math.AC↗