A combinatorial proof of Gotzmann's persistence theorem for monomial ideals

Gotzmann monomial ideals

A Gotzmann monomial ideal of the polynomial ring is a monomial ideal which is generated in one degree and which satisfies Gotzmann's persistence theorem. A subset $V$ is said to be a Gotzmann subset if the ideal generated by $V$ is a Gotzmann monomial ideal. In the present paper, we find all integers $a>0$ such that every Gotzmann subset $V$ with $|V|=a$ is lexsegment (up to the permutation of the variables). In addition, we classify all Gotzmann subsets of $K[x_1,x_2,x_3]$.

Gotzmann Monomials In Four Variables

It is a widely open problem to determine which monomials in the n-variable polynomial ring $K[x_1,...,x_n]$ over a field $K$ have the Gotzmann property, i.e. induce a Borel-stable Gotzmann monomial ideal. Since 2007, only the case $n \le 3$ was known. Here we solve the problem for the case $n = 4$. The solution involves a surprisingly intricate characterization.

关于单项式的Gotzmann阈值

On the Gotzmann threshold of monomials

本文提出一种有效算法，确定任意 n 元多项式环中单项式的 Gotzmann 阈值，并应用于 x_2^d 情形，给出 n=5 的精确结果及 n≥6 的猜想。

Gotzmann Edge Ideals

Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in degree d. The edge ideal of a simple graph G on vertices x_1, ..., x_n is the quadratic square-free monomial ideal generated by all x_i x_j where {x_i,x_j} is an edge of G. The only edge ideals that are Gotzmann are those edge ideals corresponding to star graphs.

Strong persistence and associated prime of powers of monomial ideals

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal of degree $d\leq 2$. We show that $(I^{k+1}:I)=I^k$ for all $k\geq 1$ and we disprove a motivation question that was appeared in \cite[Question 2.51]{CHHV} by providing of a counterexample. Also, by this counterexample, we give a negative answer to the question that depth function of square-free monomial ideals are non-increasing.

Replication in critical graphs and the persistence of monomial ideals

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose replication produces a (k+1)-critical graph. (The replication of a set W of vertices of a graph is the operation that adds a copy of each vertex w in W, one at a time, and connects it to w and all its neighbours.) We disprove the conjecture by providing an infinite family of counterexamples. Furthermore, the smallest member of the family answers a question …