Indexed metadata

Homological invariants of Edge Ideals associated to powers of cycles

Shahnawaz Ahmad Rather, S. Pirzada, M. Aijaz

Source record

Source: arXiv

Published: Sep 15, 2026

arXiv: 2609.17651

Open original source ↗

Source abstract

Let $G_{n,m}=\overline{\C_n^{[m]}}$, where $\C_n^{[m]}$ denotes the closed mmth power of the nn-cycle. We study the graded Betti numbers and homological invariants of the edge ring of Gn,mG_{n,m} in the range n3m+1n\geq 3m+1. These graphs form a natural family for the study of edge rings whose regularity can be compared explicitly with the induced matching number. In particular, for n4m+1n\geq4m+1, the graph Gn,mG_{n,m} has induced matching number one, whereas its edge ring has regularity two. Our approach is based on a characterization of the homology of the induced subcomplexes of the independence complex Δ(Gn,m)Δ(G_{n,m}). We introduce a family SV(k,m)\mathcal{S}_V(k,m) of vertex subsets characterized by their successive gaps around the cycle and show that, for WSV(k,m)W\in\mathcal{S}_V(k,m), the induced subcomplex Δ[W]Δ[W] has the homotopy type of S1\mathbb{S}^1, whereas for WSV(k,m)W\notin\mathcal{S}_V(k,m) all its positive-dimensional reduced homology groups vanish. Combining this characterization with Hochster's formula and an explicit enumeration of SV(k,m)\mathcal{S}_V(k,m), we obtain a closed formula for the graded Betti numbers in the second strand. We further determine the extremal Betti number, regularity, and projective dimension of the edge ring of Gn,mG_{n,m}. Finally, we compute the ff- and hh-vectors of the independence complex and use the Hilbert series to determine the graded Betti numbers in the linear strand. The case m=2m=2 recovers the corresponding results for complements of squares of cycles obtained in~\cite{RatherSquare}.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.