betaFeedback

WorksMathematics

v\mathrm{v}-numbers of powers of edge ideals of cubic circulant graphs

Abstract

In this paper, we provide the exact formula for the v\mathrm{v}-number of powers of the edge ideal of a cubic circulant graph C2n(a,n)C_{2n}(a,n) with 1≤a<n1\le a<n.

Introduction

Let R=K[x1,…,xn]=⨁d≥0RdR = \mathbb{K}[x_1,\ldots,x_n] = \bigoplus_{d\ge0} R_d be the standard graded polynomial ring over a field K\mathbb{K}. For a graded ideal I⊆RI \subseteq R, let Ass⁡(I)\operatorname{Ass}(I) denote the set of all associated prime ideals of II. For each p∈Ass⁡(I)\mathfrak{p} \in\operatorname{Ass}(I), the local vv-number of II at p\mathfrak{p} is defined as

vp(I)=min⁡{d≥0∣there exists f∈Rd such that (I:f)=p}.v_{\mathfrak{p}}(I) = \min\{d \ge0 \mid\text{there exists } f \in R_d \text{ such that } (I:f) = \mathfrak{p}\}.

The vv-number of II, denoted by v(I)v(I), is then defined as

v(I)=min⁡{vp(I)∣p∈Ass⁡(I)}.v(I) = \min\{v_{\mathfrak{p}}(I) \mid\mathfrak{p} \in\operatorname{Ass}(I)\}.

Originally introduced in [9] to analyze the asymptotic behavior of the minimum distance of projective Reed-Muller type codes, the vv-number serves as a crucial algebraic invariant connecting coding theory, commutative algebra, and combinatorics. This invariant has since spurred considerable interest in commutative algebra and algebraic combinatorics, leading to several significant applications. There has been substantial progress in understanding this invariant across different contexts (see [7, 8, 15, 17, 21, 24]). Regarding the asymptotic behavior of vv-numbers, Ficarra and Sgroi [14] and Conca [8] independently established that v(It)v(I^t) is eventually linear in tt for any graded ideal II in a polynomial ring (and more generally, in an N\mathbb{N}-graded Noetherian domain [8]). We refer the reader to [3, 12, 14, 15, 24] for further developments in this direction. In particular, Hien and Vu in [19] gave a combinatorial description of the stabilization index of the vv-function of powers of edge ideals for arbitrary graphs.

Let Γ\Gamma be a simple graph with vertex set V(Γ)={x1,…,xn}V(\Gamma) = \{x_1,\ldots,x_n\} and edge set E(Γ)E(\Gamma). The edge ideal of Γ\Gamma, introduced in [30], is denoted by I(Γ)I(\Gamma) and defined as the ideal of the polynomial ring R=K[x1,…,xn]R = \mathbb{K}[x_1,\ldots,x_n] over a field K\mathbb{K} generated by the monomials corresponding to the edges of Γ\Gamma. Explicitly,

I(Γ)=(xixj∣xixj∈E(Γ)).I(\Gamma) = (x_i x_j \mid x_i x_j \in E(\Gamma)).

2020 Mathematics Subject Classification. 13F20, 13F55, 13A15, 05E40.

Keywords: vv-number, powers of edge ideal, cubic circulant graph. The v-number of I(Γ)I(\Gamma) is a fundamental combinatorial invariant of Γ\Gamma that has been used to characterize key topological and structural properties of graphs, such as the family of W2W_2-graphs. Jaramillo and Villarreal in [22 Theorem 4.5] showed that for a connected graph Γ\Gamma, it is in W2W_2 if and only if v(I(Γ))=dim⁡(R/I(Γ))\mathrm{v}(I(\Gamma)) = \dim(R/I(\Gamma)). Furthermore, determining exact formulas for v-numbers of powers of edge ideals remains an active and challenging task. Chau et al. in [5] showed that for a path PnP_n with n≥2n \ge2 vertices and a cycle CnC_n with n≥3n \ge3 vertices, the v-number of powers of their edge ideals are

v(I(Pn)t)=2t−1+max⁡{0,⌊n−2t−34⌋}.\mathrm{v}(I(P_n)^t)=2t-1+\max\left\{0,\left\lfloor\frac{n-2t-3}{4}\right\rfloor\right\}.
v(I(Cn)t)=2t−1+max⁡{0,⌊n−2t−24⌋}.\mathrm{v}(I(C_n)^t)=2t-1+\max\left\{0,\left\lfloor\frac{n-2t-2}{4}\right\rfloor\right\}.

Circulant graphs have wide applications in coding theory, interconnection networks, and combinatorial designs [6, 23, 25]. Algebraic studies of edge ideals of circulant graphs have been carried out in [1, 4, 20, 27, 28, 29]. Recall that for a positive integer n≥3n \ge3 and a subset S⊆{1,…,⌊n/2⌋}S \subseteq\{1,\ldots,\lfloor n/2\rfloor\}, the circulant graph generated by SS, denoted by Cn(S)C_n(S), is the graph whose vertex set is V(Cn(S))={x1,x2,…,xn}V(C_n(S))=\{x_1,x_2,\ldots,x_n\}, in which two distinct vertices xix_i and xjx_j are adjacent if and only if either ∣i−j∣∈S|i-j|\in S or n−∣i−j∣∈Sn-|i-j|\in S. In particular, if S={1,…,⌊n/2⌋}S=\{1,\ldots,\lfloor n/2\rfloor\}, then Cn(S)≅KnC_n(S)\cong K_n, the complete graph on nn vertices. By Fröberg’s theorem [16], the edge ideal I(Kn)I(K_n) has a linear resolution, from which it follows from [12 Theorem 5.1] that v(I(Kn)t)=2t−1\mathrm{v}(I(K_n)^t)=2t-1 for all t≥1t\ge1. On the other hand, if S={1}S=\{1\}, then Cn(1)≅CnC_n(1)\cong C_n, whose v-number formula for powers was completely determined in [5] as mentioned above.

Despite recent progress, explicitly computing the v-number for broader classes of circulant graphs remains highly non-trivial due to their intricate topological structures. A cubic circulant graph is a 3-regular circulant graph of the form C2n(S)C_{2n}(S) with S={a,n}S=\{a,n\} for some integer aa such that 1≤a<n1\le a<n, denoted by C2n(a,n)C_{2n}(a,n). Davis and Domke [11] proved that cubic circulant graphs can be decomposed into disjoint unions of certain copies of circulant graphs of the form C2m(1,m)C_{2m}(1,m) and C2m(2,m)C_{2m}(2,m) for odd m>2m>2 (see Lemma 2.1).

The main goal of this paper is to bridge this gap by providing precise combinatorial and algebraic formulas for the v-number of cubic circulant graphs. Our main result is as follows:

Theorem 1.1. Let Γ=C2n(a,n)\Gamma=C_{2n}(a,n) be a cubic circulant graph with 1≤a<n1\le a<n, and let I(Γ)I(\Gamma) be its edge ideal. Let k=gcd⁡(a,n)k=\gcd(a,n), m=nkm=\frac{n}{k}, b=akb=\frac{a}{k}, and

ρ={m,if both m and b are odd,m+1,otherwise.\rho= \begin{cases} m, & \text{if both }m\text{ and }b\text{ are odd},\\ m+1, & \text{otherwise.} \end{cases}

Then, for all integer t≥1t\ge1,

v(I(Γ)t)=max⁡{2t+k−2, t−1+k⌊ρ3⌋, ⌈4(t−1)+kρ3⌉, ⌈3(t−1)+k(⌊ρ2⌋+1)2⌉}.\mathrm{v}(I(\Gamma)^t)=\max\left\{2t+k-2,\ t-1+k\left\lfloor\frac{\rho}{3}\right\rfloor,\ \left\lceil\frac{4(t-1)+k\rho}{3}\right\rceil,\ \left\lceil\frac{3(t-1)+k\left(\left\lfloor\frac{\rho}{2}\right\rfloor+1\right)}{2}\right\rceil\right\}.

:::_

The paper is organized as follows: § 2 introduces the basic facts and preliminary definitions that are used throughout the paper. In section 3 and 4, we provide exact formulas for the vv-numbers of powers of the edge ideals of Γ=C2n(a,n)\Gamma= C_{2n}(a,n) with 1≤a<n1 \leq a < n.

Preliminaries

In this section, we introduce the notation and recall several basic results that will be used throughout the paper. Throughout this paper, we adopt the following symbols: for two non-negative integers m,nm,n, let

[m,n]={{m,m+1,…,n},if m≤n,∅,if m>n.[m,n] = \begin{cases} \{m,m+1,\ldots,n\}, & \text{if }m \leq n,\\ \varnothing, & \text{if }m > n. \end{cases}

By convention, we write [n][n] for [1,n][1,n] and ∏i∈Axi=1\prod_{i\in A}x_i=1 if A=∅A=\varnothing.

Let Γ\Gamma be a finite simple graph with vertex set V(Γ)V(\Gamma) and edge set E(Γ)E(\Gamma). For a vertex v∈V(Γ)v \in V(\Gamma), its neighborhood is defined by NΓ(v)={u∈V(Γ)∣uv∈E(Γ)}N_{\Gamma}(v)=\{u \in V(\Gamma) \mid uv \in E(\Gamma)\}. For a subset A⊆V(Γ)A \subseteq V(\Gamma), its neighborhood is defined by NΓ(A)=⋃v∈ANΓ(v)N_{\Gamma}(A)=\bigcup_{v\in A}N_{\Gamma}(v). A subset C⊆V(Γ)C \subseteq V(\Gamma) is called a vertex cover of Γ\Gamma if every edge of Γ\Gamma has at least one endpoint in CC. A vertex cover CC is called minimal if no proper subset of CC is a vertex cover of Γ\Gamma. The vertex cover number of Γ\Gamma, denoted by τ(Γ)\tau(\Gamma), is defined as

τ(Γ)=min⁡{∣C∣:C is a vertex cover of Γ}.\tau(\Gamma)=\min\{|C|: C\text{ is a vertex cover of }\Gamma\}.

A subset S⊆V(Γ)S \subseteq V(\Gamma) is called an independent set of Γ\Gamma if no two distinct vertices in SS are adjacent. An independent set SS of Γ\Gamma is called maximal if every vertex in V(Γ)∖SV(\Gamma)\setminus S is adjacent to at least one vertex in SS. The independence number of Γ\Gamma, denoted by α(Γ)\alpha(\Gamma), is defined as

α(Γ)=max⁡{∣S∣∣S is an independent set of Γ}.\alpha(\Gamma)=\max\{|S| \mid S\text{ is an independent set of }\Gamma\}.

It is well known that a set C⊆V(Γ)C \subseteq V(\Gamma) is a minimal vertex cover of Γ\Gamma if and only if V(Γ)∖CV(\Gamma)\setminus C is a maximal independent set of Γ\Gamma. For any subset AA of V(Γ)V(\Gamma), Γ[A]\Gamma[A] denotes the induced subgraph of Γ\Gamma on the set AA, i.e., for any u,v∈Au,v \in A, uv∈E(Γ[A])uv \in E(\Gamma[A]) if and only if uv∈E(Γ)uv \in E(\Gamma).

References

  1. [1]T. Asir, D. T. Hoang, M. R. Pournaki and G. J. Zhu, On edge ideals of circulant graphs generated by integers non-coprime to a fixed integer, preprint.
  2. [2]A. Banerjee, The regularity of powers of edge ideals, J. Algebraic Combin., 41 (2015), 303–321.arxiv.org/abs/1406.0456
  3. [3]P. Biswas, M. Mandal, and K. Saha, Asymptotic behaviour and stability index of ν-numbers of graded ideals, Vietnam J. Math., 2026. DOI: 10.1007/s10013-026-00817-7.
  4. [4]J. Brown and R. Hoshino, Well-covered circulant graphs, Discrete Math., 311 (2011), 244–251.DOI
  5. [5]T. Chau, T. H. Hà, A. V. Jayanthan, and T. Vu, Comparing ν-numbers of symbolic and ordinary powers of squarefree monomial ideals, arXiv:2608.26591.arxiv.org/abs/2608.26591
  6. [6]S. Chen and X. D. Jia, Undirected loop networks, Networks, 23 (1993), 257–260.DOI
  7. [7]Y. Civan, The ν-number and Castelnuovo–Mumford regularity of graphs, J. Algebraic Combin., 57 (2023), 161–169.
  8. [8]A. Conca, A note on the ν-invariant, Proc. Amer. Math. Soc., 152 (2024), 2349–2351.
  9. [9]S. M. Cooper, A. Seceleanu, S. O. Tohăneanu, M. Vaz Pinto and R. H. Villarreal, Generalized minimum distance functions and algebraic invariants of Geramita ideals, Adv. in Appl. Math., 112 (2020), 101940.arxiv.org/abs/1812.06529
  10. [10]Y. J. Cui, G. J. Zhu and X. Q. Wei, The edge ideals of the join of some vertex weighted oriented graphs, J. Algebra Appl., 25 (2026), 2550296.
  11. [11]G. Davis and G. Domke, 3-circulant graphs, J. Combin. Math. Combin. Comput., 40 (2002), 133–142.
  12. [12]A. Ficarra, Simon conjecture and the ν-number of monomial ideals, Collect. Math., 76 (2025), 477–492.DOI
  13. [13]A. Ficarra and P. Macias Marques, The ν-function of powers of sums of ideals, J. Algebraic Combin., 62 (2025), 13.
  14. [14]A. Ficarra and E. Sgroi, Asymptotic behaviour of the ν-number of homogeneous ideals, J. Algebra, 704 (2026), 273–297.DOI
  15. [15]L. Fiorindo and D. Ghosh, On the asymptotic behavior of the Vasconcelos invariant for graded modules, Nagoya Math. J., 258 (2025), 296–310.DOI
  16. [16]R. Fröberg, On Stanley–Reisner rings, in Topics in Algebra, Part 2 (Warsaw, 1988), Banach Center Publ., vol. 26, PWN, Warsaw, 1990, pp. 57–70.DOI
  17. [17]G. Grisalde, E. Reyes, and R. H. Villarreal, Induced matchings and the ν-number of graded ideals, Mathematics, 9 (2021), 2860.DOI
  18. [18]N. T. Hang, M. H. Pham and T. Vu, Regularity of powers and symbolic powers of edge ideals of cubic circulant graphs, Ann. Comb., 30 (2026), 177–193.arxiv.org/abs/2409.20161
  19. [19]H. T. T. Hien and T. Vu, Stabilization index of ν-number of powers of edge ideals of graphs, arXiv:2609.09632.arxiv.org/abs/2609.09632
  20. [20]D. T. Hoang, H. R. Maimani, A. Mousivand, and M. R. Pournaki, Cohen–Macaulayness of two classes of circulant graphs, J. Algebraic Combin., 53 (2021), 805–827.DOI
  21. [21]W. J. Huo, G. J. Zhu and J. X. Li, The ν-number of powers of ideals associated with chessboard complexes, arXiv:2609.37112.
  22. [22]D. Jaramillo and R. H. Villarreal, The ν-number of edge ideals, J. Combin. Theory A, 177 (2021), 105310.
  23. [23]M. Karlin, New binary coding results by circulants, IEEE Trans. Inf. Theory, IT-15 (1969), 81–92.DOI
  24. [24]M. Kumar, R. Nanduri, and K. Saha, The slope of the ν-function and the Waldschmidt constant, J. Pure Appl. Algebra, 229 (2025), 107881.
  25. [25]E. A. Monakhova, A survey on undirected circulant graphs, Discrete Math. Algorithms Appl., 4 (2012), 1250002.DOI
  26. [26]H. D. Nguyen and Q. H. Tran, Powers of sums and their associated primes, Pacific J. Math., 316 (2022), 217–235.DOI
  27. [27]G. Rinaldo, Some algebraic invariants of edge ideal of circulant graphs, Bull. Math. Soc. Sci. Math. Roumanie, 61 (2018), 95–105.arxiv.org/abs/1701.01357
  28. [28]M. E. Uribe-Paczka and A. Van Tuyl, The regularity of some families of circulant graphs, Mathematics, 7 (2019), 657.
  29. [29]K. N. Vander Meulen, A. Van Tuyl and C. Watt, Cohen–Macaulay circulant graphs, Comm. Algebra, 42 (2014), 1896–1910.
  30. [30]R. H. Villarreal, Cohen–Macaulay graphs, Manuscripta Math., 66 (1990), 277–293.DOI

Paper details

vlnc:W_4yj6esq2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 3

downloads · 0

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

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents