On the Gotzmann threshold of monomials

Abstract

Let $R_n=K[x_1,\dots,x_n]$ be the $n$-variable polynomial ring over a field $K$. Let $S_n$ denote the set of monomials in $R_n$. A monomial $u \in S_n$ is a \textit{Gotzmann monomial} if the Borel-stable monomial ideal $\langle u \rangle$ it generates in $R_n$ is a Gotzmann ideal. A longstanding open problem is to determine all Gotzmann monomials in $R_n$. Given $u_0 \in S_{n-1}$, its \textit{Gotzmann threshold} is the unique nonnegative integer $t_0=τ_n(u_0)$ such that $u_0x_n^t$ is a Gotzmann monomial in $R_n$ if and only if $t \ge t_0$. Currently, the function $τ_n$ is exactly known for $n \le 4$ only. We present here an efficient procedure to determine $τ_n(u_0)$ for all $n$ and all $u_0 \in S_{n-1}$. As an application, in the critical case $u_0=x_2^d$, we determine $τ_5(x_2^d)$ for all $d$ and we conjecture that for $n \ge 6$, $τ_n(x_2^d)$ is a polynomial in $d$ of degree $2^{n-2}$ and dominant term equal to that of the $(n-2)$-iterated binomial coefficient $$ \binom {\binom {\binom d2}2}{\stackrel{\cdots}2}. $$

Theorems & Definitions (60)

• Definition 1.1
• Theorem 1.2
• Definition 1.3
• Definition 2.2
• Example 2.7
• Theorem 2.10: BBE
• Corollary 2.11
• proof
• Definition 2.12
• Definition 2.14