Pith. sign in

REVIEW 4 minor 1 cited by

Regularity of Symbolic Powers of Co-Chordal Edge Ideals

T0 review · 0 major / 4 minor · reviewed 2026-08-27 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every symbolic power of the edge ideal of a co-chordal graph has regularity exactly twice its exponent, over every field.

desk verdict A genuinely new result: exact regularity of symbolic powers for all co-chordal graphs, with a clever proof and a nice counterexample to a published conjecture. read the letter →

arxiv 2608.20542 v1 pith:ZCSFJD74 submitted 2026-08-20 math.AC math.CO

Chwas Ahmed , Mohammed Rafiq Namiq This is my paper · ORCID
classification math.ACmath.CO MSC 13F5505E4013D0205C25
keywords edgeidealsymbolicpowersregularityco-chordalgraphcliquetreeconvexgeometrycomponentwiselineardegreeresolution
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that for any finite simple co-chordal graph $G$ with at least one edge, every symbolic power $I(G)^{(s)}$ of its edge ideal has regularity exactly $2s$, over any field. Regularity is the largest degree shift appearing in a minimal free resolution, so the result says each symbolic power has a degree resolution: its syzygies are as tightly degree-constrained as possible. The theorem confirms, for the whole co-chordal class, the proposed equality between the regularities of symbolic and ordinary powers, which was previously known only in small cases or for special subclasses. The proof reduces the problem to a topological statement about clique trees of the chordal complement and closes it with a weighted counting argument.

What carries the argument

The load-bearing machinery is a chain of reductions. The degree-complex formula identifies the multigraded local cohomology group $H^\ell_\mathfrak{m}(S/J)_\mathfrak{a}$ with the reduced homology $\tilde{H}_{\ell-|N|-1}(\Delta_\mathfrak{a}(J))$ of a degree complex, where $N$ is the set of negative coordinates of $\mathfrak{a}$. For symbolic powers of co-chordal edge ideals, the facets of $\Delta_\mathfrak{a}(J)$ are described by maximal cliques of the chordal complement. A clique tree of that complement converts the degree complex, up to homotopy, into a trace complex $\mathcal{K}_A=\langle P_j\cap A : j\notin N\rangle$ on a selected node set $A$; tree convexity makes this complex closure stable, so nontrivial homology forces a free closed nonface. The final step is the weighted subtree theorem, which turns that leaf configuration into the estimate $\Omega\ge 2r+q$, equivalent to the regularity upper bound $|\mathfrak{a}|+\ell\le 2s-1$.

What would settle it

Compute the graded Betti numbers of $I(G)^{(5)}$ for the complement of the $5$-sun graph over $\mathbb{Q}$ and over $\mathbb{F}_2$; since the theorem predicts $\operatorname{reg} I(G)^{(5)}=10$, any observed regularity different from $10$ in either characteristic would refute Theorem 1.1. The lower bound is already secured by the explicit degree-$10$ generator, so the decisive check is whether any minimal syzygy has $j-i>10$.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1: over every field, $\operatorname{reg} I(G)^{(s)} = 2s$ for every $s\ge 1$ whenever $G$ is a finite simple co-chordal graph with at least one edge. A symbolic power $I(G)^{(s)}$ is the intersection of the $s$-th powers of the minimal vertex cover ideals, and its largest minimal generator has degree $2s$ because $x_u^s x_v^s$ lies in the ideal for every edge $\{u,v\}$. The theorem says no higher syzygy pushes the regularity beyond that generator degree, so $I(G)^{(s)}$ has a degree resolution. The proof establishes the matching upper bound $\operatorname{reg} S/I(G)^{(s)}\le 2s-1$ by translating multigraded local cohomology into reduced homology of degree complexes, replacing those complexes by trace complexes of subtrees in a clique tree of the chordal complement, and applying a finite convex geometry argument.

Load-bearing premise

The upper bound rests on the degree-complex formula with the specific index shift $\ell-|N|-1$ and the convention that the empty order complex has $\tilde{H}_{-1}=K$; if the cited formula were read with a different indexing convention, every regularity estimate would shift by one.

Editorial extensions

If this is right

  • For every co-chordal graph with at least one edge, each symbolic power $I(G)^{(s)}$ has a degree resolution, meaning its regularity equals the degree $2s$ of an explicit minimal generator.
  • The symbolic and ordinary power regularities agree for co-chordal graphs: $\operatorname{reg} I(G)^{(s)}=\operatorname{reg} I(G)^s=2s$ for all $s\ge1$.
  • The ideal generated by the degree-$d$ component of $I(G)^{(s)}$ has a $d$-linear resolution whenever $d\ge 2s$; only the degrees $s+2,\dots,2s-1$ remain undecided for $s\ge3$.
  • For every $s\ge4$, the complement of the $s$-sun gives a co-chordal graph whose $I(G)^{(s)}$ is not componentwise linear, so the regularity formula cannot be upgraded to componentwise linearity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The sharpness example for the weighted subtree theorem suggests that the tree data alone cannot yield a tighter bound; any finer regularity statement for neighboring graph classes would need an invariant beyond weighted subtree loads.
  • Because the proof is characteristic-free and purely combinatorial, the clique-tree trace model may extend to weighted edge ideals or to vertex-cover ideals of chordal hypergraphs, where a similar $2s$ formula might hold.
  • The failure of componentwise linearity in the middle degrees leaves the full Betti tables of $I(G)^{(s)}$ for $s\ge4$ open; the $s$-sun complement is a natural family for computing the unresolved middle components.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper studies the Castelnuovo–Mumford regularity of symbolic powers of edge ideals of co-chordal graphs. The main theorem states that for every finite simple co-chordal graph G with at least one edge, reg I(G)^{(s)} = 2s for all s ≥ 1 over any field, so every symbolic power has a degree resolution. The proof has four parts: a direct lower bound; a translation of the upper bound into vanishing of reduced homology of Takayama degree complexes; a reduction of degree complexes of symbolic powers to trace complexes built from clique trees; and a convex-geometric "free closed nonface" criterion combined with a weighted-subtree inequality. The paper also proves partial componentwise-linearity results and constructs, for every s ≥ 4, a co-chordal graph whose s-th symbolic power is not componentwise linear, disproving a conjecture of Ficarra–Moradi–Römer.

Significance. If the proof is correct, the paper settles a conjecture of Minh for all co-chordal graphs and goes beyond existing partial results (split graphs, small symbolic powers, complements of block graphs). The argument introduces a genuinely new route: the homological witness theorem for convex geometries (Theorem 4.3) and the weighted subtree inequality (Theorem 5.7) are cleanly stated and proved in detail, and Example 5.8 shows the bound is optimal. The disproof of Conjecture B of [14] and the degree-complex description for symbolic powers are additional contributions. The proof is self-contained modulo standard references, and the one non-proved input, the indexing convention in Takayama's formula, is stated explicitly and used consistently; the reader's localization check confirms compatibility with the cited framework.

minor comments (4)
  1. [Section 3, proof of Proposition 3.1] The sentence "Since Δ_a(J) is nonvoid, N is a face of Δ" uses Δ for the clique complex Cl(H), while elsewhere Δ without a subscript refers to the degree complex; making this notational distinction explicit would prevent confusion.
  2. [Section 6, proof of Theorem 1.1] The equality reg J = reg S/J + 1 is invoked without comment after the exact sequence 0 → J → S → S/J → 0; a one-sentence justification or a reference to the standard fact would be helpful.
  3. [Section 6, proof of Proposition 6.4] The collapse argument showing Δ_α(L) ≃ C_s is quite compressed; identifying the exact faces removed in each of the two collapse steps would make this part easier to verify.
  4. [Throughout] The typeset source contains many spacing and OCR artifacts, such as "regI(G) (s)" and "Hℓ m"; these should be cleaned in the final version.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the proof of Theorem 1.1 is a genuine reduction through Takayama's formula, clique trees, and a weighted subtree inequality, with no fitted input or output equal to input.

full rationale

The derivation chain is self-contained. The lower bound in Lemma 2.1 constructs an explicit minimal generator of degree 2s, and the upper bound proceeds through the standard external Takayama formula Eq. (2), the degree-complex description in Proposition 3.1 (via the external [21, Lemma 1.3]), the convex-geometry homological witness Theorem 4.3, the clique-tree trace model Proposition 5.3, and the weighted subtree estimate Theorem 5.7. The parameter identities in Eqs. (5)-(7) are exact algebraic identities, not assumptions, and the final bound |a|+l ≤ 2s-1 follows from a weighted counting argument on a tree. The only self-citations, [1] and [24], appear in Corollary 6.2 and in the terminology 'degree resolution', respectively; neither is used in the proof of Theorem 1.1. No parameter is fitted to data, no prediction reduces to its input by construction, and no load-bearing result is justified solely by the present authors' prior work. The central claim therefore has independent mathematical content and no significant circularity.

Assumptions & free parameters 0 free parameters · 8 assumptions · 0 invented entities

Free parameters: none. All numbers in the proof are integers coming from the exponent vector a and graph parameters; no constants are fitted to data. Axioms: the proof uses standard cited results: Takayama's formula, the Hoa-Trung lemma on degree complexes, Fröberg's theorem, clique tree existence and subtree representation of chordal graphs, Quillen's fiber theorem, the nerve lemma, and standard facts about meet-distributive convex geometries. None of these is equivalent to the target result, and the result is not used to justify any of them. Invented entities: none. The tree traces and tree convexity are defined from the graph and exponent vector, not postulated ad hoc.

assumptions (8)
  • standard math Takayama's formula: dim H^l_m(S/J)_a = dim Htilde_{l-|N|-1}(Delta_a(J)) (Eq. 2).
    Used in Section 3 and the proof of Theorem 1.1 to convert local cohomology to reduced homology of degree complexes. Cited to [27].
  • standard math [21, Lemma 1.3] describes the facets of degree complexes of symbolic powers of Stanley-Reisner ideals.
    Used in Proposition 3.1 to obtain the facet description Eq. (4) for I(G)^{(s)}.
  • standard math Fröberg's theorem: I(G) has a 2-linear resolution iff G^c is chordal.
    Used in the introduction and Corollary 6.1 for the converse direction.
  • standard math Chordal graphs have clique trees; each vertex's set of containing cliques is connected.
    Used throughout Section 5 to build the tree model T_N and subtrees P_j. Cited to [4,16].
  • standard math Quillen's fiber theorem (Theorem A) comparing homotopy types of poset order complexes.
    Used in Lemma 4.1 to identify the complex K with the order complex of the lower ideal I.
  • standard math Nerve lemma: a cover of a simplicial complex by contractible sets with contractible intersections is homotopy equivalent to its nerve.
    Used in Proposition 5.3 to replace the degree complex by the trace complex K_A.
  • standard math Standard facts about finite convex geometries: Krein-Milman property, meet-distributive lattices, and the Billera-Hsiao-Provan homotopy type of proper parts.
    Used in Section 4 in the proofs of Lemmas 4.1 and 4.2 and Theorem 4.3.
  • standard math Herzog-Hibi-Zheng theorem: powers of a monomial ideal with 2-linear resolution have linear resolutions.
    Used in the introduction and final paragraph to state the equality for ordinary powers.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Regularity of Symbolic Powers of Co-Chordal Edge Ideals." pith.science (2026). https://pith.science/paper/ZCSFJD74

@misc{pith2026260820542,
  author       = {Pith},
  title        = {Pith review of: Regularity of Symbolic Powers of Co-Chordal Edge Ideals},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZCSFJD74}},
  note         = {Machine review of arXiv:2608.20542}
}
abstract

Let $G$ be a finite simple co-chordal graph with at least one edge, and let $I(G)$ be its edge ideal. Over an arbitrary field, we prove that the symbolic powers of $I(G)$ satisfy $\operatorname{reg} I(G)^{(s)}=2s$ for every $s\ge1$. Thus every symbolic power of $I(G)$ has a degree resolution. Using Takayama's formula and clique trees, we reduce the regularity problem to a topological one. Finite convex geometry then shows that nontrivial homology implies a suitable set of leaves, and a weighted counting argument gives the required regularity formula. Finally, we show that symbolic powers of co-chordal edge ideals are not necessarily componentwise linear.

Figures

Figures reproduced from arXiv: 2608.20542 by the authors.

Figure 1
Figure 1. The 4-sun graph H4. Declarations Data Availability. No data were generated or analyzed in this study. Competing Interests. The authors declare no competing interests. References [1] C. Ahmed, R. Fr¨oberg, and M. R. Namiq, The graded Betti numbers of truncation of ideals in polynomial rings, J. Algebraic Combin. 57 (2023), no. 4, 1303–1312. doi:10.1007/s10801-023-01230-w. [2] L. J. Billera, S. K. Hsiao, and J. S. Pro… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth

    math.AC 2026-09 accept novelty 6.0 of 10

    For edge ideals of simplicial graphs, ordinary and symbolic powers have equal regularity, and the size of their difference is controlled by induced odd cycles.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages · cited by 1 Pith paper

  1. [14]

    Ficarra, S

    A. Ficarra, S. Moradi, and T. R¨ omer,Componentwise linear symbolic powers of edge ideals and Minh’s conjecture, J. Algebraic Combin.62(2025), no. 4, Article 56. doi:10.1007/s10801-025-01485-5

    work page doi:10.1007/s10801-025-01485-5 2025

  2. [1]

    Ahmed, R

    C. Ahmed, R. Fr¨ oberg, and M. R. Namiq,The graded Betti numbers of truncation of ideals in polynomial rings, J. Algebraic Combin.57(2023), no. 4, 1303–1312. doi:10.1007/s10801-023-01230-w

    work page doi:10.1007/s10801-023-01230-w 2023

  3. [2]

    L. J. Billera, S. K. Hsiao, and J. S. Provan,Enumeration in convex geometries and associated polytopal subdivisions of spheres, Discrete Comput. Geom.39(2008), nos. 1–3, 123–137. doi:10.1007/s00454-007-9020-3

    work page doi:10.1007/s00454-007-9020-3 2008

  4. [3]

    Bj¨ orner,Topological methods, in R

    A. Bj¨ orner,Topological methods, in R. L. Graham, M. Gr¨ otschel, and L. Lov´ asz (eds.),Handbook of Combinatorics, Vols. 1–2, Elsevier, Amsterdam, 1995, pp. 1819–1872

    work page 1995

  5. [4]

    J. R. S. Blair and B. W. Peyton,An introduction to chordal graphs and clique trees, in A. George, J. R. Gilbert, and J. W. H. Liu (eds.),Graph Theory and Sparse Matrix Computation, IMA Vol. Math. Appl.56, Springer, New York, 1993, pp. 1–29

    work page 1993

  6. [5]

    Caviglia, H

    G. Caviglia, H. T. H` a, J. Herzog, M. Kummini, N. Terai, and N. V. Trung,Depth and regularity modulo a principal ideal, J. Algebraic Combin.49(2019), no. 1, 1–20. doi:10.1007/s10801-018-0811-9

    work page doi:10.1007/s10801-018-0811-9 2019

  7. [6]

    S. D. Cutkosky, J. Herzog, and N. V. Trung,Asymptotic behaviour of the Castelnuovo–Mumford regularity, Compos. Math.118(1999), no. 3, 243–261. doi:10.1023/A:1001559912258

    work page doi:10.1023/a:1001559912258 1999

  8. [7]

    L. X. Dung, T. T. Hien, H. D. Nguyen, and T. N. Trung,Regularity and Koszul property of symbolic powers of monomial ideals, Math. Z.298(2021), nos. 3–4, 1487–1522. doi:10.1007/s00209-020-02657-8. 14 CHWAS AHMED 1,2 AND MOHAMMED RAFIQ NAMIQ 1

    work page doi:10.1007/s00209-020-02657-8 2021

Show all 27 references
  1. [8]

    P. H. Edelman,Meet-distributive lattices and the anti-exchange closure, Algebra Universalis10(1980), no. 1, 290–299. doi:10.1007/BF02482912

    1980 doi

  2. [9]

    P. H. Edelman and R. E. Jamison,The theory of convex geometries, Geom. Dedicata19(1985), no. 3, 247–270. doi:10.1007/BF00149365

    1985 doi

  3. [11]

    S. A. Seyed Fakhari,Regularity of symbolic powers of edge ideals of unicyclic graphs, J. Algebra541(2020), 345–358. doi:10.1016/j.jalgebra.2019.08.039

    2020 doi

  4. [12]

    S. A. Seyed Fakhari,Regularity of symbolic powers of edge ideals of chordal graphs, Kyoto J. Math.62(2022), no. 4, 753–762. doi:10.1215/21562261-2022-0025

    2022 doi

  5. [13]

    S. A. Seyed Fakhari,On the regularity of small symbolic powers of edge ideals of graphs, Math. Scand.129(2023), no. 1, 39–59. doi:10.7146/math.scand.a-134104

    2023 doi

  6. [15]

    Fr¨ oberg,On Stanley–Reisner rings, inTopics in Algebra, Part 2, Banach Center Publ.26(1990), no

    R. Fr¨ oberg,On Stanley–Reisner rings, inTopics in Algebra, Part 2, Banach Center Publ.26(1990), no. 2, 57–70. doi:10.4064/-26-2-57-70

    1990 doi

  7. [16]

    Gavril,The intersection graphs of subtrees in trees are exactly the chordal graphs, J

    F. Gavril,The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B 16(1974), no. 1, 47–56. doi:10.1016/0095-8956(74)90094-X

    1974 doi

  8. [17]

    Y. Gu, H. T. H` a, J. L. O’Rourke, and J. W. Skelton,Symbolic powers of edge ideals of graphs, Comm. Algebra 48(2020), no. 9, 3743–3760. doi:10.1080/00927872.2020.1745221

    2020

  9. [18]

    Nguyen Thu Hang, M. H. Pham, and T. Vu,Regularity of powers and symbolic powers of edge ideals of cubic circulant graphs, Ann. Comb.30(2026), no. 1, 177–193. doi:10.1007/s00026-025-00765-y

    2026 doi

  10. [19]

    Herzog, T

    J. Herzog, T. Hibi, and N. V. Trung,Symbolic powers of monomial ideals and vertex cover algebras, Adv. Math. 210(2007), no. 1, 304–322. doi:10.1016/j.aim.2006.06.007

    2007 doi

  11. [20]

    Herzog, T

    J. Herzog, T. Hibi, and X. Zheng,Monomial ideals whose powers have a linear resolution, Math. Scand.95 (2004), no. 1, 23–32. doi:10.7146/math.scand.a-14446

    2004 doi

  12. [21]

    L. T. Hoa and T. N. Trung,Castelnuovo–Mumford regularity of symbolic powers of two-dimensional square-free monomial ideals, J. Commut. Algebra8(2016), no. 1, 77–88. doi:10.1216/JCA-2016-8-1-77

    2016 doi

  13. [22]

    Kodiyalam,Asymptotic behaviour of Castelnuovo–Mumford regularity, Proc

    V. Kodiyalam,Asymptotic behaviour of Castelnuovo–Mumford regularity, Proc. Amer. Math. Soc.128(2000), no. 2, 407–411. doi:10.1090/S0002-9939-99-05020-0

    2000 doi

  14. [23]

    N. C. Minh and T. Vu,Survey on regularity of symbolic powers of an edge ideal, in I. Peeva (ed.),Commutative Algebra, Springer, Cham, 2021, pp. 569–588. doi:10.1007/978-3-030-89694-2_18

    2021 doi

  15. [24]

    M. R. Namiq,The graded Betti numbers of the skeletons of simplicial complexes, Indag. Math. (N.S.) (2026), in press. doi:10.1016/j.indag.2026.03.006

    2026 doi

  16. [25]

    Quillen,Homotopy properties of the poset of nontrivial p-subgroups of a group, Adv

    D. Quillen,Homotopy properties of the poset of nontrivial p-subgroups of a group, Adv. Math.28(1978), no. 2, 101–128. doi:10.1016/0001-8708(78)90058-0

    1978 doi

  17. [26]

    Simis, W

    A. Simis, W. V. Vasconcelos, and R. H. Villarreal,On the ideal theory of graphs, J. Algebra167(1994), no. 2, 389–416. doi:10.1006/jabr.1994.1192

    1994

  18. [27]

    Takayama,Combinatorial characterizations of generalized Cohen–Macaulay monomial ideals, Bull

    Y. Takayama,Combinatorial characterizations of generalized Cohen–Macaulay monomial ideals, Bull. Math. Soc. Sci. Math. Roumanie (N.S.)48(96)(2005), no. 3, 327–344

    2005

  19. [28]

    R. H. Villarreal,Cohen–Macaulay graphs, Manuscripta Math.66(1990), no. 3, 277–293. doi: 10.1007/BF02568497. 1 Department of Mathematics, College of Science, University of Sulaimani, Sulaimani, Kurdistan Region, Iraq. 2 Department of Mathematics and Natural Sciences, American U...

    1990 doi

Pith tools

Reviewed August 27, 2026 · model on record in the stance chip above.