This paper proves that the regularity of powers of cover ideals of unimodular hypergraphs grows linearly with the power, and provides bounds for the linearity of certain algebraic invariants.
Contribution
It establishes the linearity of the regularity and $a_i$-invariants of powers of cover ideals for unimodular hypergraphs, extending understanding of their algebraic properties.
Findings
01
$
eg J( ext{H})^s$ is linear in $s$ for large $s$
02
$a_i(R/J( ext{H})^s)$ is linear in $s$ for $s o ext{large}$
03
Provides explicit bounds for the linearity in terms of hypergraph parameters
Abstract
Let \H be a unimodular hypergraph over the vertex set [n] and let J()˝ be the cover ideal of \H in the polynomial ring R=K[x1,…,xn]. We show that \regJ()˝s is a linear function in s for all s⩾r⌈2n⌉+1 where r is the rank of \H. Moreover for every i, ai(R/J()˝s) is also a linear function in s for s⩾n2.
Equations162
ai(M):=max{t∣Hmi(M)t=0},
ai(M):=max{t∣Hmi(M)t=0},
reg(M):=max{ai(M)+i∣i=0,…,dimM}.
reg(M):=max{ai(M)+i∣i=0,…,dimM}.
regIs=ds+e for all s⩾s0.
regIs=ds+e for all s⩾s0.
regIs=1+regR/Is=1+max{ai(R/Is)+i∣i=0,…,dimR/I},
regIs=1+regR/Is=1+max{ai(R/Is)+i∣i=0,…,dimR/I},
J(H):=(xτ∣τ is a minimal vertex cover of H).
J(H):=(xτ∣τ is a minimal vertex cover of H).
IΔ:=(xτ∣τ∈/Δ)⊆R.
IΔ:=(xτ∣τ∈/Δ)⊆R.
IΔ=F∈F(Δ)⋂(xi∣i∈/F).
IΔ=F∈F(Δ)⋂(xi∣i∈/F).
IΔ(n)=F∈F(Δ)⋂(xi∣i∈/F)n.
IΔ(n)=F∈F(Δ)⋂(xi∣i∈/F)n.
J(H)=E∈E⋂(xi∣i∈E).
J(H)=E∈E⋂(xi∣i∈E).
Δ(J(H))=⟨V∖E∣E∈E⟩.
Δ(J(H))=⟨V∖E∣E∈E⟩.
Δα(I):={F⊆V∖Gα∣xα∈/IRF}.
Δα(I):={F⊆V∖Gα∣xα∈/IRF}.
Δα(J(H)s)=⟨V∖E∣E∈E and i∈E∑αi⩽s−1⟩.
Δα(J(H)s)=⟨V∖E∣E∈E and i∈E∑αi⩽s−1⟩.
δ(S):=max{∣α∣∣α∈S}.
δ(S):=max{∣α∣∣α∈S}.
Hmp(R/J(H)q)β=0
Hmp(R/J(H)q)β=0
dimKHp−1(Δβ(J(H)q);K)=dimKHmp(R/J(H)q)β=0.
dimKHp−1(Δβ(J(H)q);K)=dimKHmp(R/J(H)q)β=0.
Δ(J(H))=⟨V∖E1,…,V∖Em⟩.
Δ(J(H))=⟨V∖E1,…,V∖Em⟩.
Δβ(J(H)q)=⟨V∖E1,…,V∖Ek⟩
Δβ(J(H)q)=⟨V∖E1,…,V∖Ek⟩
⎩⎨⎧∑i∈Ejxi⩽t−1∑i∈Ejxi⩾tx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽t−1∑i∈Ejxi⩾tx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽t∑i∈Ejxi⩾tx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽t∑i∈Ejxi⩾tx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽n−1∑i∈Ejxi⩾nx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽n−1∑i∈Ejxi⩾nx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi<1∑i∈Ejxi⩾1x1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi<1∑i∈Ejxi⩾1x1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi<n∑i∈Ejxi⩾nx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi<n∑i∈Ejxi⩾nx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
δ(C1)=∣γ∣=γ1+⋯+γn.
δ(C1)=∣γ∣=γ1+⋯+γn.
δ(Pt)=dt−et for some integer et⩾0.
δ(Pt)=dt−et for some integer et⩾0.
{∑i∈Ej(αi+γi)⩽t∑i∈Ej(αi+γi)⩾t+1 for j=1,…,k, for j=k+1,…,m.
{∑i∈Ej(αi+γi)⩽t∑i∈Ej(αi+γi)⩾t+1 for j=1,…,k, for j=k+1,…,m.
δ(Pt)=dt−e for t⩾r⌈2n⌉+1
δ(Pt)=dt−e for t⩾r⌈2n⌉+1
δ(Pt)=dt−e, for all t⩾t0.
δ(Pt)=dt−e, for all t⩾t0.
δ(Pt)⩽dt−e whenever Pt=∅.
δ(Pt)⩽dt−e whenever Pt=∅.
⎩⎨⎧∑i∈Ejxi⩽s−1∑i∈Ejxi⩾sx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
⎩⎨⎧∑i∈Ejxi⩽s−1∑i∈Ejxi⩾sx1⩾0,…,xn⩾0. for j=1,…,k, for j=k+1,…,m,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Regularity of powers of cover ideals of unimodular hypergraphs
Nguyen Thu Hang
Thai Nguyen College of Sciences, Thai Nguyen University, Thai Nguyen, Vietnam
Dedicated to Professor Le Tuan Hoa on his 60th birthday
Abstract.
Let H be a unimodular hypergraph over the vertex set [n] and let J(H) be the cover ideal of H in the polynomial ring R=K[x1,…,xn]. We show that regJ(H)s is a linear function in s for all s⩾r⌈2n⌉+1 where r is the rank of H. Moreover for every i, ai(R/J(H)s) is also a linear function in s for s⩾n2.
Key words and phrases:
Regularity, cover ideals, powers of ideals
1991 Mathematics Subject Classification:
13A15, 13C13.
Introduction
Let R:=K[x1,…,xn] be a polynomial ring over a field K and m:=(x1,…,xn) the maximal homogeneous ideal of R. Let M be a finitely generated graded R-module. For each i=0,…,dimM we define the ai-invariant of M by
[TABLE]
where Hmi(M) is the i-th local cohomology module of M with support in m (with the convention max∅=−∞); and the Castelnuovo-Mumford regularity (or regularity for short) of M is defined by
[TABLE]
Let I be a homogeneous ideal in R. It is well-known that regIs is a linear function in s for s big enough (see [9, 20, 26]). More precisely, there are non-negative integers d,e and s0 such that
[TABLE]
While d can be determined in terms of generators of I (see [20]), there are no good interpretations for e and s0. Two natural questions arise from this result (see [11]):
(1)
What is the nature of the number e?
2. (2)
What is a reasonable bound for s0?
These problems are continue to attract us (see [1, 2, 4, 5, 6, 10, 11, 12, 13, 19, 23]). When I is generated by forms of the same degree, there is a geometric interpretation for e (see [6, 10, 12]). Effective bounds of s0 are known only for a few special classes of ideals I, such as edge ideals of forests and unicyclic graphs (see [1, 5, 19]), m-primary ideals (see [4, 7]).
Notice that
[TABLE]
it is also natural to ask whether ai(R/Is) is asymptotically linear in s or not. However, there is an example such that lims→∞sregIs is an irrational number (see [8]), so that ai(R/Is) need not to be linear when s large. If we assume furthermore that I is a monomial ideal then ai(R/Is) is a quasi-linear function in s due to [17], but we still do not know whether ai(R/Is) is asymptotically linear in s or not.
In this paper when I is the cover ideal of a unimodular hypergraph, we will prove that ai(R/Is) is actually asymptotically linear in s. Using this result we are able to give a reasonable bound of s0 for which regIs is a linear function in s for all s⩾s0.
Before stating our result we recall some terminology from graph theory (see [3] for more detail). Let V=[n]:={1,…,n}, and let E be a family of distinct nonempty subsets of V. The pair H=(V,E) is called a hypergraph with vertex set V and edge set E. The rank of H, denoted by rank(H), is the maximum cardinality of any of the edges in H. Notice that a hypergraph generalizes the classical notion of a graph; a graph is a hypergraph of rank at most 2. One may also define a hypergraph by its incidence matrix A(H)=(aij), with columns representing the edges E1,E2,…,Em and rows representing the vertices 1,2,…,n where aij=0 if i∈/Ej and aij=1 if i∈Ej. A hypergraph H is said to be unimodular if its incident matrix is totally unimodular, i.e., every square submatrix of A(H) has determinant equal to 0,1 or −1.
A vertex cover of H is a subset of V which meets every edge of H; a vertex cover is minimal if none of its proper subsets is itself a cover. For a subset τ={i1,…,it} of V, set xτ:=xi1⋯xit. The cover ideal of H is then defined by
[TABLE]
It is well-known that there is one-to-one correspondence between squarefree monomial ideals of R and cover ideals of hypergraphs on the vertex set V.
The first main result of this paper is the following theorem.
Theorem 3.2 *For any i, we have either ai(R/J(H)s)=−∞ for all s⩾1 or there are positive integers d and e with d⩽e such that ai(R/J(H)s)=ds−e for all s⩾n2.
*
We next address the question of bounding s0 for which regIs is a linear function in s whenever s⩾s0. Let d(J(H)) be the maximal degree of minimal monomial generators of J(H). Then, the main result of the paper is the following theorem.
Theorem 3.3 *Let H be a unimodular hypergraph with n vertices and rank r. Then there is a non-negative integer e⩽dimR/J(H)−d(J(H))+1 such that regJ(H)s=d(J(H))s+e for all s⩾r⌈2n⌉+1.
*
When H is a bipartite graph G with n vertices, it is unimodular by [3, Theorem 5]. The theorem 3.3 now says that reg(J(G)s) is a linear function in s for all s⩾n+2.
Our approach is based on a generalized Hochster’s formula for computing local cohomology modules of arbitrary monomial ideals formulated by Takayama [25]. Using this formula we are able to investigate the ai-invariants of powers of monomial ideals via the integer solutions of certain systems of linear inequalities. This allows us to use the theory of integer programming as the key role in this paper (see e.g. [14, 16, 17] for this approach).
The paper is organized as follows. In Section 1, we set up some basic notation and terminology for simplicial complex, the relationship between simplicial complexes and cover ideals of hypergraphs; and give a generalization of Hochster’s formula for computing local cohomology modules. In Section 2, we investigate the integer solutions of systems of linear inequalities with totally unimodular matrices. In Section 3, we prove that ai(R/J(H)s) is an asymptotically linear function in s, and settle the problems when regJ(H)s becomes a linear function in s, where H is a unimodular hypergraph.
1. Preliminary
Let K be a field and let R:=K[x1,⋯,xn] be a polynomial ring over n variables. We first recall a relationship between cover ideals of hypergraphs and simplicial complexes. A simplicial complex on V={1,…,n} is a collection of subsets of V such that if σ∈Δ and τ⊆σ then τ∈Δ.
Definition 1.1**.**
The Stanley-Reisner ideal associated to a simplicial complex Δ is the squarefree monomial ideal
[TABLE]
Note that if I is a squarefree monomial ideal, then it is a Stanley-Reisner ideal of the simplicial complex Δ(I):={τ⊆V∣xτ∈/I}. If I is a monomial ideal (maybe not squarefree) we also use Δ(I) to denote the simplicial complex corresponding to the squarefree monomial ideal I.
Let F(Δ) be the set of facets of Δ. If F(Δ)={F1,…,Fm}, we write Δ=⟨F1,…,Fm⟩. Then, IΔ has the primary-decomposition (see [22, Theorem 1.7]):
[TABLE]
For n⩾1, the n-th symbolic power of IΔ is
[TABLE]
Let H=(V,E) be a hypergraph. Then, the cover ideal of H can be written as
[TABLE]
By this formula, when considering J(H) without loss of generality we may assume that H is *simple *, i.e., whenever Ei,Ej∈E and Ei⊆Ej, then Ei=Ej. In this case, J(H) is a Stanley-Reisner ideal with
[TABLE]
Let I be a non-zero monomial ideal. Since R/I is an Nn− graded algebra, Hmi(R/I) is an Zn-graded module over R/I for every i. For each degree α=(α1,…,αn)∈Zn, in order to compute dimKHmi(R/I)α we use a formula given by Takayama [25, Theorem 2.2] which is a generalization of Hochster’s formula for the case I is squarefree [18, Theorem 4.1].
Set Gα:={i∣αi<0}. For a subset F⊆V, we let RF:=R[xi−1∣i∈F∪Gα]. Define the simplicial complex Δα(I) by
If H is unimodular, the cover ideal J(H) is normally torsion-free, i.e. J(H)(s)=J(H)s for all s⩾1 by [15, Theorem 1.1]. Combining with [21, Lemma 1.3] we obtain:
Lemma 1.3**.**
Let H=(V,E) be a unimodular hypergraph with V={1,…,n}, and α=(α1,…,αn)∈Nn. Then, for every s⩾1 we have
[TABLE]
2. Integer polytopes
For a vector α=(α1,…,αn)∈Rn, we set ∣α∣:=α1+⋯+αn and for a nonempty bounded closed subset S of Rn we set
[TABLE]
Let H=(V,E) be a unimodular hypergraph on the vertex set V={1,…,n}. Assume that
[TABLE]
for some p⩾0, q⩾1 and β=(β1,…,βn)∈Nn.
By Lemma 1.2 we have
[TABLE]
In particular, Δβ(J(H)q) is not acyclic.
Suppose that E={E1,…,Em} where m⩾1. Then, by Equation (\refcomplex−cover)
[TABLE]
Since Δβ(J(H)q) is not acyclic, by Lemma 1.3 we may assume that
[TABLE]
where 1⩽k⩽m.
For each integer t⩾1, let Pt be the set of solutions in Rn of the following system:
[TABLE]
Then, β∈Pq. Moreover, by Lemma 1.3 one has
[TABLE]
In order to investigate the set Pt we consider Ct to be the set of solutions in Rn of the following system:
[TABLE]
Since H is unimodular, we have both Pt and Ct are integer convex polyhedra by [24, Theorem 19.1], i.e. all their vertices have integer coordinates.
Lemma 2.1**.**
[14, Lemma 2.1]** C1 is a polytope with dimC1=n.
Remark 2.2**.**
Since Ct=tC1 is also a polytope, it is bounded. Thus, for every i=1,…,n, from the system (\refEQ−polytope) we imply that i∈Ej for some 1⩽j⩽k.
Observe that Pt⊆Ct, so Pt is a polytope as well.
Lemma 2.3**.**
Pn=∅.
Proof.
From the system (\refEQ−basics), Pn is the set of solutions of the following system:
[TABLE]
If k=m, then the zero vector of Rn is in Pn, and then Pn=∅.
Assume that k<m. From the system (\refEQ−polytope) we conclude that ∑i∈Emxi=1 is a supporting hyperplane of C1. Let F be the facet of C1 determined by this hyperplane. Now take n vertices of C1 lying in F, say α1,…,αn, such that they are affinely independent. Let α:=(α1+⋯+αn)/n∈C1. Then, α is a relative interior point of F, so that it does not belong to any another facet of C1. Thus, α is a solution of the following system:
[TABLE]
Therefore, nα is a solution of the following system
[TABLE]
Together with the fact that nα∈Nn, it yields nα∈Pn, and thus Pn=∅.
∎
Since C1 is a polytope, there is a vertex γ=(γ1,…,γn) of C1 such that
[TABLE]
Let d:=∣γ∣. Note that tγ is also a vertex of Ct and δ(Ct)=dt. Since Pt⊆Ct, we have δ(Pt)⩽dt, so we can write
[TABLE]
Remark 2.4**.**
Since C1 is a polytope of dimension n, we have d⩾1.
Lemma 2.5**.**
If Pt=∅, then Pt+1=∅ and et⩾et+1.
Proof.
Let α=(α1,…,αn)∈Pt such that δ(Pt)=∣α∣. Since α is a solution of the system (\refEQ−basics), and γ is a solution of the system (\refEQ−polytope) with 1 in place of t, we deduce that
[TABLE]
In other words, α+γ∈Pt+1. Therefore, Pt+1=∅ and δ(Pt+1)⩾∣α∣+∣γ∣. Since δ(Pt+1)=d(t+1)−et+1 and ∣α∣+∣γ∣=d(t+1)−et, we have et⩾et+1.
∎
For a real number x we denote by ⌈x⌉ the least integer ⩾x. The following lemma plays a key role in the paper. It says that δ(Pt) is a linear function in t for t big enough.
Lemma 2.6**.**
There are non-negative integers d and e with e⩽n2 such that
[TABLE]
where r=rank(H).
Proof.
By Lemmas 2.3 and 2.5 we have en⩾en+1⩾⋯⩾0. It follows that there is t0⩾n such that et=et0 for t⩾t0. Let e:=et0. Then,
[TABLE]
By Lemma 2.5 we have
[TABLE]
Let s be an integer such that s⩾max{n2+e+1,t0}. Then, δ(Ps)=ds−e. Because Ps is a polytope, we have δ(Ps)=∣α∣ for some vertex α of Ps. By the system (\refEQ−basics), the polytope Ps is defined by
[TABLE]
By [24, Formula 23 in Page 104] we can represent α as the unique solution of a system of linear equations of the form
[TABLE]
where S1⊆[k], S2⊆{k+1,…,m} and S3⊆[n] such that ∣S1∣+∣S2∣+∣S3∣=n.
Let A be the matrix of the system (\refEQ−alpha) and write α=(α1,…,αn). For each i, let Ai be the matrix obtained from A by replacing the i-th column by: the first ∣S1∣ entries are s−1, the next ∣S2∣ consecutive entries are s, and the last ∣S3∣ entries are zeroes. Then, by Cramer’s rule we have
[TABLE]
Since H is unimodular, A is totally unimodular, and so det(A)=±1. Without loss of generality, we may assume that det(A)=1. Thus,
αi=det(Ai), for i=1,…,n.
Write the matrix Ai in the form
[TABLE]
and let
[TABLE]
Then, det(Ai)=det(Di)s−det(Ci). Let di:=det(Di) and ci:=det(Ci) so that
[TABLE]
When deleting the i-th column from Ci we get a totally unimodular matrix. Therefore, by expanding the determinant of Ci along the i-th column we obtain
[TABLE]
Let d′:=d1+⋯+dn and c′:=c1+⋯+cn. Then, we have ∣α∣=d′s−c′ and ∣c′∣⩽n∣S1∣⩽n2. Since δ(Ps)=ds−e, we have ds−e=d′s−c′. Thus, (d−d′)s=e−c′. Note that ∣e−c′∣⩽e+n2<s. It follows that d−d′=0 and e−c′=0, i.e. d=d′ and e=c′. In particular, e⩽n2.
As α=(d1s−c1,…,dns−cn)∈Nn and ∣ci∣⩽∣S1∣⩽n<s, for every i we have
[TABLE]
Since α∈Ps, from the system (\refLE) we have
[TABLE]
Together with ∑i∈Ej∣ci∣⩽∣Ej∣n⩽rn for every j and s⩾rn+1, it follows that
[TABLE]
for j=1,…,k.
Similarly, we also have
[TABLE]
for j=k+1,…,m.
We first claim that
[TABLE]
Indeed, by Remark 2.2, we have i∈Ej for some j∈[k] , and hence by (\refCL2) we have
[TABLE]
We next claim that
[TABLE]
Indeed, if ∣S1∣⩽⌈2n⌉, then the claim follows from (\refIQ−c). We now verify the claim for the case ∣S1∣>⌈2n⌉, so that ∣S2∣<⌈2n⌉. Let Ei be the maxtrix obtained by replacing the i-th column of Ai by the first ∣S1∣ entries are zeroes, the next ∣S2∣ consecutive entries are 1, and the last ∣S3∣ entries are zeroes. Then, by expanding ∣Ei∣ along the i-th column we get ∣det(Ei)∣⩽∣S2∣. On the other hand, by (\refEQ−DC) we have det(Di)=det(Ci)+det(Ei). Thus, ∣ci∣⩽∣di∣+∣det(Ei)∣⩽∣di∣+∣S2∣. Together with Claims (\refCL1) and (\refD1) it yields ∣ci∣⩽1+∣S2∣⩽⌈2n⌉,
as claimed.
We now turn to prove the lemma by showing that δ(Pt)=dt−e for all t⩾r⌈2n⌉+1. Indeed, let t be such an integer, and define
[TABLE]
We prove that α(t) satisfies the system (\refEQ−basics). Firstly, since ⌈2n⌉<t, by (\refCL1) and (\refCL4) we have α(t)i⩾0 for i=1,…,n.
Next, for j=1,…,k, by (\refCL2) we have two possible cases:
Case 1: ∑i∈Ejdi=0. Together with (\refCL4) we obtain
[TABLE]
Case 2: ∑i∈Ejdi=1 and ∑i∈Ejci⩾1. Then,
[TABLE]
In both cases we have ∑i∈Ejα(t)i⩽t−1.
Further, for j=k+1,…,m, by (\refCL3) we also have two possible cases:
Case 1: ∑i∈Ejdi=1 and ∑i∈Ejci⩽0. In this case,
[TABLE]
Case 2: ∑i∈Ejdi⩾2. Let ρ:=∣{i∈Ej∣di=1}∣. By (\refCL1) and Claim (\refD1) we have ρ=∑i∈Ejdi⩾2. Note that if di=0 then ci⩽0 since α∈Nn. Together with Claim (\refCL4), it gives
[TABLE]
On the other hand r=rankH⩾∣Ej∣⩾ρ, so that
[TABLE]
It follows that
[TABLE]
Hence, ∑i∈Ejα(t)i⩾t in both cases. Thus, α(t) is a solution of the system (\refEQ−basics), and thus α(t)∈Pt. In particular,
[TABLE]
Together with (\refUPBa) we conclude that δ(Pt)=dt−e, and the lemma follows.
∎
Lemma 2.7**.**
Assume that δ(Pt)=dt−e for all t≫0. Then, d⩽e.
Proof.
Observe that δ(Pt) is the optimal value of the linear programming problem
[TABLE]
subject to
[TABLE]
Let A be the matrix of the first k inequalities of this system and B the matrix of the next q:=m−k inequalities. Then, the dual problem is
[TABLE]
subject to
[TABLE]
where 1n=(1,…,1)∈Rn.
Since (\refdual) defines a pointed convex polyhedron in Rm, say Q, we deduce that there is a vertex (u1,…,uk,v1,…,vq) of Q such that in this convex polyhedron
[TABLE]
where a=u1+⋯+uk−(v1+⋯+vq) and b=u1+⋯+uk. Since ui⩾0 and vj⩾0 for every i and j, we have a⩽b.
By the Duality theorem of linear programing (see e.g. [24, Corollary 7.1g]) we have
[TABLE]
Therefore, δ(Pt)=dt−e=at−b for t≫0. It follows that d=a and e=b. Consequently, d⩽e, as required.
∎
3. Regularity of powers of ideals
Let H=(V,E) be a unimodular hypergraph on the vertex set V={1,…,n}. Without loss of generality we may assume that E=∅ and thus J(H)=0. Let r:=rank(H). In this section we will prove that ai(R/J(H)s) is asymptotically linear in s; and then settle the problem on bounding s0 such that regJ(H)s is a linear function for s⩾s0.
Lemma 3.1**.**
Assume that ap(R/J(H)s)=−∞ for some p⩾0 and s⩾1. Then, there are positive integers d and e such that
(1)
d⩽e⩽n2;
2. (2)
ap(R/J(H)t)⩾dt−e* for all t⩾r⌈2n⌉+1; and*
3. (3)
If s⩾r⌈2n⌉+1, then ap(R/J(H)s)=ds−e.
Proof.
Since ap(R/J(H)s)=−∞, there is β′=(β1,…,βn)∈Zn such that
[TABLE]
By Lemma 1.2 we have
[TABLE]
In particular, Δβ′(J(H)s) is not acyclic.
If Gβ′=[n], then Δβ′(J(H)s) is either {∅} or a void complex. Since it is not acyclic, Δβ′(J(H)s)={∅}. But then by (\refdegree−complex) we would have J(H)=0, a contradiction. Therefore, Gβ′=[n].
We may assume that Gβ′={m+1,…,n} for some 1⩽m⩽n. Set S:=K[x1,…,xm]. Let H′ be the hypergraph on the vertex set V′={1,…,m} with the edge set E′={E∈E∣E⊆V′}. Since A(H′) is a submatrix of A(H), we have H′ is also a unimodular hypergraph. Moreover, by (\refintersect) we obtain:
[TABLE]
Let β:=(β1,…,βm)∈Nm. By using Formulas (\refdegree−complex) and (\refEQ−LOCALIZATION) we get
[TABLE]
Together with (\refN1), it gives Hp−∣Gβ′∣−1(Δβ(J(H′)s);K)=0. By Lemma 1.2 we get
[TABLE]
where n=(x1,…,xm) is the homogeneous maximal ideal of S.
Suppose that E′={E1,…,Ek} where k⩾1. Then, by Equation (\refcomplex−cover)
[TABLE]
By Lemma 1.3 we may assume that
[TABLE]
where 1⩽q⩽k.
For each integer t⩾1, let Pt be the set of solutions in Rm of the following system:
[TABLE]
Then, β∈Ps. From (\refQt) and Lemma 1.3 one has
[TABLE]
Together Lemmas 2.6 and 2.7 with Remark 2.4, there are positive integers d and f with d⩽f⩽m2 such that
[TABLE]
For any t⩾r⌈2n⌉+1, we also have δ(Pt)=dt−f. Let α=(α1,…,αm) be a vertex of Pt such that δ(Pt)=∣α∣. Since A(H′) is totally unimodular, α∈Nm.
Let α′=(α1,…,αm,−1,…,−1)∈Zn. Then, Gα′=Gβ′, and by (\refPOWER) and (\refEQ001) we obtain
[TABLE]
By Lemma 1.2 we have
[TABLE]
Consequently, Hmp(R/J(H)t)α′=0, and so
[TABLE]
where we set e:=f+n−m. Note that d⩽f⩽e⩽m2+(n−m)⩽n2.
This argument shows that β′=(β1,…,βm,−1,…,−1) and ∣β∣=δ(Ps). Therefore, if s⩾r⌈2n⌉+1 then ∣β∣=δ(Ps)=ds−f and
[TABLE]
and the lemma follows.
∎
We now prove that ai(R/J(H)s) is asymptotically linear in s.
Theorem 3.2**.**
For any i, we have either ai(R/J(H)s)=−∞ for all s⩾1 or there are positive integers d and e with d⩽e such that ai(R/J(H)s)=ds−e for all s⩾n2.
Proof.
If n=1, then R=K[x1] and J(H)=(x1), and then the theorem holds for this case. We therefore may assume that n⩾2.
Assume that ai(R/J(H)k)=−∞ for some k⩾1. By Lemma 3.1 we have ai(R/J(H)t)=−∞ for every t⩾r⌈2n⌉+1.
Let s0 be an integer such that s0⩾n2. Note that r⌈2n⌉+1⩽n2 as n⩾2, so ai(R/J(H)s0)=−∞. By Lemma 3.1, there are positive integers d and e with d⩽e⩽n2 such that
(a)
ai(R/J(H)s0)=ds0−e; and
2. (b)
ai(R/J(H)t)⩾dt−e for all t⩾r⌈2n⌉+1.
We will prove that ai(R/J(H)s)=ds−e for all s⩾n2. Indeed, for any s⩾n2, by Lemma 3.1 again, there are positive integers a and b with a⩽b⩽n2 such that
(c)
ai(R/J(H)s)=as−b; and
2. (d)
ai(R/J(H)t)⩾at−b for all t⩾r⌈2n⌉+1.
From (b) and (c) we have as−b⩾ds−e, or equivalently,
[TABLE]
Note that 1⩽b,e⩽n2, so ∣b−e∣=max{b−e,e−b}⩽n2−1<s. Together with the inequality (\refMF1), this fact forces a⩾d.
Similarly, by using (a) and (d) we obtain d⩾a and
[TABLE]
Thus, a=d. Together this fact with Inequalities (\refMF1) and (\refMF2), respectively, we get e⩾b and b⩾e, respectively. Hence, b=e. Then,
[TABLE]
and the proof is complete.
∎
The following theorem is the main result of this paper.
Theorem 3.3**.**
Let H be a unimodular hypergraph with n vertices and rank r. Then there is a non-negative integer e⩽dimR/J(H)−d(J(H))+1 such that regJ(H)s=d(J(H))s+e for all s⩾r⌈2n⌉+1.
Proof.
If n=1 or r=1, then J(H) is a principal ideal, and the theorem holds for these cases. Hence we may assume that n⩾2 and r⩾2.
Let δ:=dimR/J(H). Then, δ<n as J(H)=0. Since
[TABLE]
by Theorem 3.2 we imply that there are integers t0, d and e with e⩽δ−d such that
[TABLE]
Note that regJ(H)t=regR/J(H)t+1, so when comparing with [20, Theorem 5] we deduce that d=d(J(H)) and e⩾−1. Consequently, e⩽δ−d(J(H)).
Let k be an integer such that k⩾max{t0,2n2}. Assume that regR/J(H)k=ai(R/J(H)k)+i, for some 0⩽i⩽δ. By Lemma 3.1, there are non-negative integers a and b′ with a⩽b′⩽n2 such that
ai(R/J(H)k)=ak−b′ and ai(R/J(H)t)⩾at−b′ for all t⩾r⌈2n⌉+1.
Let b:=−b′+i. Then, −n2⩽b⩽i−a⩽δ−a, regR/J(H)k=ak+b and
[TABLE]
As regR/J(H)k=ak+b=dk+e, we have (d−a)k=b−e. Together with the fact ∣b−e∣⩽∣b∣+e⩽n2+δ+1⩽n2+n<2n2⩽k, it forces d=a, and so b=e. Thus, (\refF0) becomes
[TABLE]
We next prove that these inequalities are in fact equalities and therefore the theorem follows because regJ(H)t=regR/J(H)t+1 for t⩾1.
In order to prove this, let s be an integer such that s⩾r⌈2n⌉+1. By the argument above, there are integers c and f with f⩽δ−c such that
regR/J(H)s=cs+f and
[TABLE]
From (\refbasic−eq) and (\refF2) we get c⩽d. Since regR/J(H)s=cs+f, by (\refF1) we have cs+f⩾ds+e, so (d−c)s⩽f−e. As c⩽d, it follows that f⩾e. In particular, f⩾−1. Observe that n⩽s as r⩾2, so that
[TABLE]
Together with (d−c)s⩽f−e and c⩽d, this fact forces d−c=0, i.e. d=c. Combining this equality with (\refbasic−eq) and (\refF2) we get e⩾f, and therefore e=f.
Finally, because d=c and e=f, we have regR/J(H)s=cs+f=ds+e, and the proof of the theorem is complete.
∎
Corollary 3.4**.**
Let G be a bipartite graph with n vertices. Then, regJ(G)s is a linear function in s for all s⩾n+2.
Acknowledgment
This work is partially supported by NAFOSTED (Vietnam) under the grant number 101.04-2015.02. The first author is also partially supported by Thai Nguyen university of Science under the grant number ĐH2016-TN06-03.
Bibliography26
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Alilooee, S. Beyarslan and S. Selvaraja, Regularity of Powers of Unicyclic Graphs , ar Xiv:1702.00916.
2[2] A. Banerjee, The regularity of powers of edge ideals , J. Algebr. Comb. 41 (2015), no. 2, 303 – 321.
3[3] C. Berge, Hypergraphs: combinatorics of finite sets. North-Holland, New York, 1989.
4[4] D. Berlekamp, Regularity defect stabilization of powers of an ideal . Math. Res. Lett. 19 (2012), no. 1, 109 – 119.
5[5] S. Beyarslan, H a ` ` a \rm\grave{a} H.T. and T. N. Trung. Regularity of powers of forests and cycles , J. Algebraic Combin., 42 (2015), no. 4, 1077 – 1095.
6[6] M. Chardin, Powers of ideals and the cohomology of stalks and fibers of morphisms , Algebra Number Theory 7 (2013), no. 1, 1 – 18.
7[7] M. Chardin, Regularity stabilization for the powers of graded 𝔐 𝔐 \mathfrak{M} -primary ideals . Proc. Amer. Math. Soc. 143 (2015), no. 8, 3343–3349.
8[8] S. Cutkosky, Irrational asymptotic behaviour of Castelnuovo-Mumford regularity , J. Reine Angew. Math. 522 (2000), 93 – 103.