Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

The number of edges of a symmetric edge polytope

T0 review · 3 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

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

Pith's one-line read Every symmetric edge polytope of a connected graph has at least |E|(2|V|−5)+|E3| edges, with equality only for three graph families.

desk verdict The paper's real result is a sharp lower bound with a plus sign; as printed, the minus sign makes the main theorem false for K3, and Eq. (17) has factor and sign mistakes. read the letter →

arxiv 2512.16572 v2 pith:ANTCNRXW submitted 2025-12-18 math.CO

Giulia Codenotti , Roberto Riccardi , Lorenzo Venturello This is my paper · ORCID
classification math.CO MSC 52B2005C35
keywords symmetricedgepolytopelattice1-skeletoncountγ-polynomialh*-polynomialcompletebipartitegraphcycledecomposition
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

The paper establishes a sharp lower bound on the number of edges of the symmetric edge polytope of a connected graph: $f_1(P_G) \geq |E|(2|V|-5)+|E_3(G)|$, where $|E_3(G)|$ counts the edges that lie in a triangle. The bound is tight exactly for complete graphs, complete tripartite graphs with parts of sizes 1,1,n−2, and complete bipartite graphs $K_{2,n-2}$. The proof is purely combinatorial: it splits the polytope's edge count into local contributions from each graph edge and controls those contributions through a decomposition of the graph into simpler subgraphs. The same discrepancy quantity turns out to be the quadratic coefficient of a sum of γ-polynomial differences under edge deletion, so the bound also proves the first nontrivial coefficient in a proposed route to a γ-positivity conjecture for symmetric edge polytopes.

What carries the argument

The central mechanism is a local counting function $Z(G,l)$ attached to each edge $l$, defined so that the global discrepancy $z_2(G)=f_1(P_G)-|E|(2|V|-5)-|E_3(G)|$ is half the sum of $Z(G,l)$ over all edges. The proof controls $Z(G,l)$ through a recursive construction of $G$ from a single edge using two moves: adding a new leaf vertex and adding an edge between existing vertices. The delicate part is the latter move, where the change in $Z$ depends on whether the added edge creates a 4-cycle containing $l$. The paper introduces 'pages': induced 4-cycles containing $l$, grouped into equivalence classes $B(G,l)$ under sharing two edges. It proves the inequality $Z(G,l) \geq 2 - 2\cdot 1_{E_3}(l) - 2B(G,l) + 4N$, showing that

What would settle it

Enumerate $f_1(P_G)$ for all connected graphs with up to eight vertices by direct computation of the 1-skeleton; if any graph violates $f_1(P_G) \geq |E|(2|V|-5)+|E_3(G)|$, the bound fails. Alternatively, compute $Z(G,l)$ via its definition for a graph containing two pages of $l$ that share three edges; if inequality (12) is violated, the combinatorial proof collapses.

Watch

Extended reading notes

Core claim

For any connected graph $G$, let $P_G$ be the convex hull of the vectors $\pm(e_i - e_j)$ for each edge $\{i,j\}$. The paper proves that the number $f_1(P_G)$ of edges of this lattice polytope satisfies $f_1(P_G) \geq |E|(2|V|-5)+|E_3(G)|$, where $|E_3(G)|$ is the number of edges of $G$ that belong to a triangle. Equality holds precisely when $G$ is a complete graph, a complete tripartite graph with parts $(1,1,n-2)$, or a complete bipartite graph $K_{2,n-2}$. The starting observation is that two oriented edges of $G$ form an edge of $P_G$ exactly when they are not contained together in an oriented 3-cycle or 4-cycle, which reduces the problem to a cycle-counting question. The paper then proves the bound by a careful local anal

Load-bearing premise

The proof depends on the claim that the local contribution $Z(G,l)$ is always controlled by the page-class count $B(G,l)$ through the inequality in Proposition 3.8, and that the case analysis behind it covers every possible configuration of 3- and 4-cycles an edge can generate during the recursive construction, including pairs of pages sharing three edges and chords that could turn an expected two-edge contribution into zero.

Editorial extensions

If this is right

  • The lower bound is sharp: the only connected graphs whose symmetric edge polytope has exactly |E|(2|V|−5)+|E3(G)| edges are complete graphs, K_{1,1,n−2}, and K_{2,n−2}.
  • For every 2-connected graph, there is an edge whose deletion leaves the second γ-coefficient of the h*-polynomial unchanged or increased, so the quadratic coefficient of the sum Z_G(t) is always nonnegative.
  • The equality z2 = f1(P_G)−|E|(2|V|−5)−|E3(G)| connects the purely graph-theoretic bound to the Ehrhart theory of symmetric edge polytopes.
  • If the stronger conjecture that all coefficients of Z_G(t) are nonnegative holds, then the γ-positivity conjecture for symmetric edge polytopes follows by induction on the cyclomatic number.
  • The paper verifies this stronger conjecture computationally for all 2-connected graphs with up to eight vertices.

Reading between the lines

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

  • The same page-counting technique might extend to bound the number of higher-dimensional faces of P_G by decomposing longer cycles into equivalence classes, not just 4-cycles.
  • The equality families—complete, complete tripartite, and complete bipartite—are exactly the graphs whose polytope skeletons are most economical, possibly reflecting a rigidity property of the 1-skeleton under vertex or edge additions.
  • The conjectured palindromic layer decomposition of h*_{P_G}(t)−h*_{P_{G\e}}(t) is not summandwise γ-positive (the paper gives a counterexample), so any proof of γ-positivity via that route must rely on cancellation between layers; understanding that cancellation could be the key to the full conjecture.
  • A testable extension: compute Z_G(t) for larger random graphs or for graphs arising from matroid constructions to see whether nonnegativity of all coefficients persists, which would sharpen where the difficulty in the γ-positivity conjecture lies.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper studies symmetric edge polytopes P_G of finite simple connected graphs. Its central result is a sharp lower bound on the number of edges f_1(P_G) in terms of |E|, |V|, and |E_3(G)|, together with a characterization of the graphs attaining equality (Theorem A / Theorem 3.1 and Corollary 4.3). The proof in Section 3 is graph-theoretic: it decomposes f_1 into local contributions Z(G,l), organizes 4-cycles containing a fixed edge into equivalence classes ('pages'), and analyzes a five-step recursive construction of G from a single edge. Section 4 uses the same machinery to classify the equality cases. Section 5 shifts to Ehrhart theory: using HJM triangulations and the Betke–McMullen formula, the authors derive an expression for h^*_{P_G}(t)-h^*_{P_{G\setminus e}}(t), define Z_G(t) as the sum of the corresponding γ-polynomials over all edges, and connect its quadratic coefficient to f_1(P_G). Section 6 proposes conjectures on palindromic decompositions of the deletion difference.

Significance. If the intended statements are correct, the paper gives a sharp, elementary edge-count bound for an important family of lattice polytopes and an equality classification that is both clean and nontrivial. The Ehrhart connection — expressing the quadratic γ-coefficient of Z_G(t) in terms of f_1(P_G) — is a promising new bridge between the graph-theoretic boundary structure and the h^*-polynomial, and it supplies a first step toward the Ohsugi–Tsuchiya γ-positivity conjecture. The paper also reports computer verification of Conjecture 5.6 for all 2-connected graphs up to 8 vertices, and the use of HJM triangulations and the Betke–McMullen formula is methodologically sound. However, as written, several displayed central claims are internally inconsistent: the sign error in Theorem 3.1/Corollary 4.3 makes those statements false for K_3, and Eq. (17) is off by a factor and a sign. These are not cosmetic issues; they affect the main theorem and the Ehrhart comparison.

major comments (3)
  1. [Theorem 3.1 / Eq. (3) / Corollary 4.3] The displayed statements use the wrong sign. Theorem 3.1, the abstract, and Corollary 4.3 state f_1(P_G) ≥ |E|(2|V|-5) - |E_3(G)|, but Eq. (3) defines z_2(G) := f_1(P_G) - |E|(2|V|-5) - |E_3(G)| and the text says Theorem 3.1 is equivalent to z_2 ≥ 0; that equivalence holds only for the plus-sign version. Concretely, for G=K_3, Lemma 3.2 and direct counting give f_1(P_{K_3})=6, whereas the printed RHS is 0; Corollary 4.3 would then assert z_2(K_3)=0 even though Eq. (3) gives 6. Lemma 3.2, the equality cases G≅K_n,K_{1,1,n-2},K_{2,n-2}, and Theorem D all point to the intended bound f_1(P_G) ≥ |E|(2|V|-5) + |E_3(G)|. The sign must be corrected throughout.
  2. [§5.3, Eq. (17)] The displayed identity in Eq. (17) is not consistent with the preceding formulas. Summing Eq. (16) over e∈E and using Lemma 5.12 along with the fact that summing |N_{P_G}(e_ij)| over one orientation of each graph edge gives f_1(P_G), one obtains ∑_e γ_2(c_e) = 2f_1(P_G) + (10-4|V|)|E| - 2|E_3| = 2( f_1(P_G) - |E|(2|V|-5) - |E_3| ), i.e., 2z_2(G), not z_2(G). The printed second equality in (17) has the wrong sign in the |E|-term and an extra factor in f_1; this makes Theorem D false as stated (for K_3, Z_G has no t^2 term, while the displayed formula would give 12). In the same paragraph, the definition of E_3 as the set of edges 'contained in a cycle' must read 'contained in a 3-cycle.'
  3. [§3, Proposition 3.4] The proof of the central lower bound rests on a case analysis that is only partially formalized. In particular, the classification in Lemma 3.6 of the three possible behaviors of B(G_i,l), and the assertion that every move in (S3b) falls into one of the cases illustrated in Figures 4–7, are not fully proved; Figures 9–13 are then used as input to the estimates N' ≥ B-1 etc. I did not find a concrete counterexample to the intended plus-version bound, but the argument should be expanded into a complete, unambiguous case analysis or supplemented with a machine-checked certificate before the paper can be considered fully verified.
minor comments (4)
  1. [Prop. 5.2] The base case cy(G)=0 is described as 'G is a tree', but a 2-connected graph with cyclomatic number 0 is not a tree (except for a single vertex). Since the reduction to 2-connected components is used, the induction should either start at cycles (cy=1) or state the reduction more carefully.
  2. [Throughout Section 5] Several formulas are missing the set-difference symbol: 'P_G P_{G\setminus ij}', 'PG PG ij', and similar expressions appear repeatedly. This makes the section harder to read and should be fixed.
  3. [Eq. (17)] Beyond the sign/factor issue (see major comment), the notation z_2 is used both for the quadratic coefficient of Z_G(t) in Theorem D and for the combinatorial quantity in Eq. (3). These are different functions as currently defined; the paper should use distinct symbols or explicitly state the intended equality.
  4. [Example 5.8] The displayed formula for Z_{C_n}(t) uses summation bounds ⌊(n-1)/2⌋; it would help to state the range of n and to double-check the boundary case n=3, where the expression should reduce consistently with Example 5.7.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular dependency: the edge-count bound is proved by independent graph bookkeeping, and the Ehrhart connection is derived rather than assumed.

full rationale

The central result, Theorem 3.1, is proved by a self-contained graph-theoretic counting argument: Lemma 3.2 expresses f1(PG) in terms of oriented edges avoiding common 3- and 4-cycles, Eq. (4) defines per-edge contributions Z(G,l), and Proposition 3.4 controls these contributions through the page-equivalence bookkeeping of Section 3. No parameter is fitted to data, no target quantity is used as an input, and the equality cases in Corollary 4.3 are extracted from the same bookkeeping rather than imported from an external source. The Ehrhart connection in Section 5 is likewise a forward derivation: HJM triangulations and the Betke-McMullen formula yield Lemma 5.5, Lemma 5.12 identifies f0(Γij) with the neighbor count of eij in PG, and summing over edges gives Eq. (17). The quantity z2(G) in Eq. (3) is a reformulation of the lower bound, but the paper does not assume that the Ehrhart coefficient z2 equals z2(G); it derives that asserted identity geometrically. Citations to [OT21a], [DJKKV23], and [HJM19] are background, a conjecture, or triangulation tools; the earlier [DJKKV23] result is mentioned as a prior proof of Theorem 5.13, but the paper also gives its own route through Theorem 3.1, so the self-citation is not load-bearing. The text does contain serious internal-consistency defects: the printed signs in Theorem A/Corollary 4.3 conflict with Eq. (3) (for K3 the printed RHS is 0 while f1(PK3)=6), Eq. (17) appears off by a factor of 2, and the phrase 'contained in a cycle' near Eq. (17) should read 'contained in a 3-cycle.' These are correctness/typo issues that need fixing, but they do not make the derivation circular: the conclusions are not identical to the assumptions by construction, and I found no fitted-input-called-prediction, no uniqueness imported from overlapping authors, and no ansatz smuggled in through a self-citation.

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

No free parameters are fitted; the bound is a pure combinatorial-geometric theorem. The axioms are standard background theorems or domain assumptions about symmetric edge polytopes and their triangulations. No new entities such as particles, forces, or empirical constants are introduced.

assumptions (6)
  • standard math Ehrhart-Stanley: for an integral polytope with a unimodular triangulation T, h*_P(t) = h_T(t).
    Theorem 2.1 is used to compare h*-polynomials with h-polynomials of HJM triangulations.
  • standard math Hibi's criterion: a lattice polytope is reflexive if and only if its h*-polynomial is palindromic.
    Used to justify rewriting h* in the gamma basis and to keep the center of symmetry fixed under edge deletion.
  • standard math Betke-McMullen formula: h*_|Delta|(z) = sum over sigma of h_link(sigma)(z) ell*_sigma(z).
    Theorem 2.2 is the core tool in the derivation of the h*-difference formula in Section 5.
  • domain assumption HJM triangulations of symmetric edge polytopes are regular unimodular triangulations.
    The construction of Gamma_ij and Delta_ij in Section 5 relies on the HJM triangulation from [HJM19].
  • domain assumption For a 2-connected graph G and edge ij, deleting ij keeps the graph connected, so dim P_G = dim P_{G\ij} and the difference of h*-polynomials is palindromic.
    Used throughout Section 5 to make the gamma expansion of c_ij meaningful.
  • standard math Every palindromic polynomial has a unique expansion in the gamma basis.
    This is the standard algebraic fact used to define gamma polynomials.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The number of edges of a symmetric edge polytope." pith.science (2026). https://pith.science/paper/ANTCNRXW

@misc{pith2026251216572,
  author       = {Pith},
  title        = {Pith review of: The number of edges of a symmetric edge polytope},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ANTCNRXW}},
  note         = {Machine review of arXiv:2512.16572}
}
read the original abstract

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of the symmetric edge polytope of a graph as a function of elementary graph invariants. Moreover, we characterize graphs attaining this bound. We highlight a connection with the h*-polynomial of such polytopes and, motivated by a conjecture of Ohsugi and Tsuchiya, we investigate the behaviour of such polynomial under edge-deletion in the graph.

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. Minkowski decomposability of symmetric edge polytopes

    math.CO 2026-08 conditional novelty 7.0 of 10

    P_G^± is Minkowski decomposable if and only if G is K_n, K_{2,n−2}, or K_{1,1,n−2}.

Reference graph

Works this paper leans on

25 extracted references · cited by 1 Pith paper

  1. [1]

    Athanasiadis

    Christos A. Athanasiadis. Gamma-positivity in combinatorics and geometry. S\' e m. Lothar. Combin. , 77:Art. B77i, 64, [2016-2018]

    2016

  2. [2]

    Thin polytopes: Lattice polytopes with vanishing local h*-polynomial

    Christopher Borger, Andreas Kretschmer, and Benjamin Nill. Thin polytopes: Lattice polytopes with vanishing local h*-polynomial. International Mathematics Research Notices , 2024(7):5619--5657, 10 2023

    2024

  3. [3]

    Lattice points in lattice polytopes

    Ulrich Betke and Peter McMullen. Lattice points in lattice polytopes. Monatshefte für Mathematik , 99:253--266, 1985

    1985

  4. [4]

    Unimodality, log-concavity, real-rootedness and beyond

    Petter Br \" a nd \' e n. Unimodality, log-concavity, real-rootedness and beyond. In Handbook of enumerative combinatorics , Discrete Math. Appl. (Boca Raton), pages 437--483. CRC Press, Boca Raton, FL, 2015

    2015

  5. [5]

    Facets and facet subgraphs of symmetric edge polytopes

    Tianran Chen, Robert Davis, and Evgeniia Korchevskaia. Facets and facet subgraphs of symmetric edge polytopes. Discrete Applied Mathematics , 328:139--153, 2023

    2023

  6. [6]

    Counting equilibria of the K uramoto model using birationally invariant intersection index

    Tianran Chen, Robert Davis, and Dhagash Mehta. Counting equilibria of the K uramoto model using birationally invariant intersection index. SIAM J. Appl. Algebra Geom. , 2(4):489--507, 2018

    2018

  7. [7]

    u rk \" u \

    T \" u rk \" u \" O zl \" u m C elik, Asgar Jamneshan, Guido Mont \' u far, Bernd Sturmfels, and Lorenzo Venturello. Wasserstein distance to independence models. J. Symbolic Comput. , 104:855--873, 2021

    2021

  8. [8]

    Many F aces of S ymmetric E dge P olytopes

    Alessio D'Al \`i , Emanuele Delucchi, and Mateusz Micha ek. Many F aces of S ymmetric E dge P olytopes. Electron. J. Combin. , 29(3):Paper No. 3.24--, 2022

    2022

Show all 25 references
  1. [9]

    Fundamental polytopes of metric trees via parallel connections of matroids

    Emanuele Delucchi and Linard Hoessly. Fundamental polytopes of metric trees via parallel connections of matroids. European J. Combin. , 87:103098, 18, 2020

    2020

  2. [10]

    On a generalization of symmetric edge polytopes to regular matroids

    Alessio D’Alì, Martina Juhnke-Kubitzke, and Melissa Koch. On a generalization of symmetric edge polytopes to regular matroids. International Mathematics Research Notices , 2024(14):10844--10864, 05 2024

    2024

  3. [11]

    On the gamma-vector of symmetric edge polytopes

    Alessio D'Al \`i , Martina Juhnke-Kubitzke, Daniel K\" o hne, and Lorenzo Venturello. On the gamma-vector of symmetric edge polytopes. SIAM Journal on Discrete Mathematics , 37(2):487--515, 2023

    2023

  4. [12]

    Sur les poly\`edres rationnels homoth\' e tiques \`a n dimensions

    Eug\`ene Ehrhart. Sur les poly\`edres rationnels homoth\' e tiques \`a n dimensions. C. R. Acad. Sci. Paris , 254:616--618, 1962

    1962

  5. [13]

    \' S wiatos aw R. Gal. Real root conjecture fails for five- and higher-dimensional spheres. Discrete Comput. Geom. , 34(2):269--284, 2005

    2005

  6. [14]

    Dual polytopes of rational convex polytopes

    Takayuki Hibi. Dual polytopes of rational convex polytopes. Combinatorica , 12(2):237--240, 1992

    1992

  7. [15]

    Arithmetic aspects of symmetric edge polytopes

    Akihiro Higashitani, Katharina Jochemko, and Mateusz Micha ek. Arithmetic aspects of symmetric edge polytopes. Mathematika , 65(3):763--784, 2019

    2019

  8. [16]

    h^* -vectors of graph polytopes using activities of dissecting spanning trees

    Tam\'as K\'alm\'an and Lilla T\'othm\'er\'esz. h^* -vectors of graph polytopes using activities of dissecting spanning trees. Algebraic Combinatorics , 6(6):1637--1651, 2023

    2023

  9. [17]

    Roots of E hrhart polynomials arising from graphs

    Tetsushi Matsui, Akihiro Higashitani, Yuuki Nagazawa, Hidefumi Ohsugi, and Takayuki Hibi. Roots of E hrhart polynomials arising from graphs. J. Algebraic Combin. , 34(4):721--749, 2011

    2011

  10. [18]

    Number of facets of symmetric edge polytopes arising from join graphs

    Aki Mori, Kenta Mori, and Hidefumi Ohsugi. Number of facets of symmetric edge polytopes arising from join graphs. European Journal of Combinatorics , 127:104165, 2025

    2025

  11. [19]

    The h^* -polynomials of locally anti-blocking lattice polytopes and their -positivity

    Hidefumi Ohsugi and Akiyoshi Tsuchiya. The h^* -polynomials of locally anti-blocking lattice polytopes and their -positivity. Discrete Comput. Geom. , 66(2):701--722, 2021

    2021

  12. [20]

    Symmetric edge polytopes and matching generating polynomials

    Hidefumi Ohsugi and Akiyoshi Tsuchiya. Symmetric edge polytopes and matching generating polynomials. Comb. Theory , 1:Paper No. 9, 19, 2021

    2021

  13. [21]

    Richard P. Stanley. Decompositions of rational convex polytopes. Ann. Discrete Math. , 6:333--342, 1980

    1980

  14. [22]

    Richard P. Stanley. Log-concave and unimodal sequences in algebra, combinatorics, and geometry. Annals of the New York Academy of Sciences , 576(1):500--535, 1989

    1989

  15. [23]

    Richard P. Stanley. Subdivisions and local h -vectors. J. Amer. Math. Soc. , 5(4):805--851, 1992

    1992

  16. [24]

    Richard P. Stanley. Combinatorics and commutative algebra , volume 41 of Progress in Mathematics . Birkh\" a user Boston, Inc., Boston, MA, second edition, 1996

    1996

  17. [25]

    Anatoly M. Vershik. Classification of finite metric spaces and combinatorics of convex polytopes. Arnold Math. J. , 1(1):75--81, 2015

    2015

Pith tools

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