pith. sign in

arxiv: 2606.20430 · v2 · pith:EJCEKIRQnew · submitted 2026-06-18 · 🧮 math.CO

Simplex faces and quadratic toric ideals of lattice polytopes

Aki Mori , Hidefumi Ohsugi This is my paper

Pith reviewed 2026-06-30 10:31 UTC · model grok-4.3

classification 🧮 math.CO
keywords lattice polytopestoric idealsquadratic binomialsclique-face property1-skeletonedge polytopescut polytopesmatroid polytopes
0
0 comments X

The pith

Under a mild condition on edges, if the toric ideal of a lattice polytope is generated by quadratic binomials, then every clique of its 1-skeleton is the vertex set of a face.

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

The paper introduces the clique-face property for lattice polytopes and proves its connection to quadratic generation of toric ideals. It shows that under a mild condition on edges, quadratic binomial generators imply that cliques in the 1-skeleton correspond to faces. This holds in particular for (0,1)-polytopes, allowing further characterization in terms of monomial divisibility and applications to edge polytopes, cut polytopes, and matroid polytopes. A sympathetic reader would care because the result supplies a geometric test that can simplify verification of when a toric ideal admits a quadratic generating set.

Core claim

The authors prove that, under a mild condition on edges, if the toric ideal of a lattice polytope is generated by quadratic binomials, then every clique of its 1-skeleton is the vertex set of a face. In particular, this holds for (0,1)-polytopes. For (0,1)-polytopes satisfying condition (E), the clique-face property is characterized in terms of divisibility by quadratic monomials appearing in the toric ideal, which implies that such ideals have no indispensable monomials of degree at least 3. The clique-face property is equivalent to quadratic generation for edge polytopes and cut polytopes. The authors also verify the clique-face property for simple polytopes, matroid independence polytopes

What carries the argument

The clique-face property, which states that every clique of the 1-skeleton of the lattice polytope is the vertex set of a face.

Load-bearing premise

The lattice polytope satisfies the mild condition on edges.

What would settle it

A lattice polytope that meets the mild edge condition, has a toric ideal generated by quadratic binomials, yet possesses a clique in its 1-skeleton that is not the vertex set of any face.

read the original abstract

We introduce the clique-face property for lattice polytopes and investigate its relationship with quadratic generation of toric ideals. We prove that, under a mild condition on edges, if the toric ideal of a lattice polytope is generated by quadratic binomials, then every clique of its 1-skeleton is the vertex set of a face. In particular, if the toric ideal of a $(0,1)$-polytope is generated by quadratic binomials, then every clique of its 1-skeleton is the vertex set of a face. For $(0,1)$-polytopes satisfying condition (E), we characterize this clique-face property in terms of divisibility by quadratic monomials appearing in quadratic binomials of the toric ideal; as a consequence, such toric ideals have no indispensable monomials of degree $\ge 3$. We apply these results to edge polytopes and cut polytopes, for which the clique-face property is equivalent to quadratic generation. Finally, motivated by conjectures on quadratic toric ideals, we verify the clique-face property for simple polytopes, matroid independence polytopes, and matroid base polytopes, and discuss stable set polytopes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript introduces the clique-face property for lattice polytopes and proves that, under a mild condition on edges, quadratic binomial generation of the toric ideal implies that every clique in the 1-skeleton is the vertex set of a face. It gives an unconditional version of this implication for (0,1)-polytopes, a characterization of the property for (0,1)-polytopes satisfying condition (E) in terms of quadratic monomial divisibility (with the consequence that there are no indispensable monomials of degree ≥3), and applications showing equivalence for edge and cut polytopes. It also verifies the clique-face property for simple polytopes, matroid independence polytopes, and matroid base polytopes.

Significance. If the proofs hold, the work supplies a new combinatorial criterion linking the 1-skeleton of a lattice polytope to the algebraic structure of its toric ideal. The applications to edge/cut polytopes and the verifications for matroid polytopes are concrete contributions; the characterization for (0,1)-polytopes under condition (E) is a useful structural result if the mild-edge hypothesis can be controlled.

major comments (2)
  1. [Abstract] Abstract (and the corresponding theorem statement): the main implication requires a mild condition on edges, yet the 'in particular' claim asserts the implication unconditionally for every (0,1)-polytope whose toric ideal is quadratically generated. The manuscript must either prove that every (0,1)-polytope satisfies condition (E) or supply a separate argument that bypasses the condition; without this, the headline result for (0,1)-polytopes rests on an unverified transfer of the hypothesis.
  2. [Abstract] The characterization for (0,1)-polytopes satisfying condition (E) (the paragraph beginning 'For (0,1)-polytopes satisfying condition (E)'): the claim that the toric ideal then has no indispensable monomials of degree ≥3 is stated as a consequence, but the argument relating the divisibility condition on quadratic monomials to the absence of higher-degree indispensable monomials is not visible from the abstract and must be checked for load-bearing gaps in the derivation.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and the constructive major comments. We address each point below and will revise the manuscript accordingly to strengthen the presentation and close the identified gaps.

read point-by-point responses

  1. Referee: [Abstract] Abstract (and the corresponding theorem statement): the main implication requires a mild condition on edges, yet the 'in particular' claim asserts the implication unconditionally for every (0,1)-polytope whose toric ideal is quadratically generated. The manuscript must either prove that every (0,1)-polytope satisfies condition (E) or supply a separate argument that bypasses the condition; without this, the headline result for (0,1)-polytopes rests on an unverified transfer of the hypothesis.

    Authors: We agree that the transfer of the hypothesis to all (0,1)-polytopes requires explicit justification. Condition (E) is a mild restriction on the edges of the 1-skeleton that is automatically satisfied by every (0,1)-polytope: any edge connects two vertices differing in exactly one coordinate, so the forbidden edge configurations in the definition of (E) cannot occur. We will insert a short lemma establishing this fact immediately after the definition of condition (E) and before the statement of the main theorem; the 'in particular' claim will then rest on a verified special case rather than an implicit transfer. revision: yes

  2. Referee: [Abstract] The characterization for (0,1)-polytopes satisfying condition (E) (the paragraph beginning 'For (0,1)-polytopes satisfying condition (E)'): the claim that the toric ideal then has no indispensable monomials of degree ≥3 is stated as a consequence, but the argument relating the divisibility condition on quadratic monomials to the absence of higher-degree indispensable monomials is not visible from the abstract and must be checked for load-bearing gaps in the derivation.

    Authors: The full argument appears in Section 4 (Theorem 4.3 and its proof): the divisibility condition on quadratic monomials implies that every monomial of degree at least 3 is divisible by a quadratic monomial that appears in a binomial generator, and the standard criterion for indispensable monomials then forces all such higher-degree monomials to be reducible, hence not indispensable. No load-bearing gaps exist in the derivation. To address the visibility concern we will add one sentence to the abstract summarizing the key step ('via the fact that every higher-degree monomial is divisible by a quadratic monomial from the generators'). revision: partial

Circularity Check

0 steps flagged

No circularity; standard definitions and implications with independent content.

full rationale

The paper introduces the clique-face property as a new definition and proves implications from quadratic generation of toric ideals to this property under stated conditions, using standard toric ideal and polytope machinery. No self-definitional reductions, fitted inputs renamed as predictions, or load-bearing self-citations appear in the provided abstract or description. The 'in particular' statement for (0,1)-polytopes is presented as a direct consequence within the paper's framework without reducing to prior author results by construction. The derivation chain remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The claims rest on standard definitions from combinatorial commutative algebra together with the newly introduced clique-face property. No numerical free parameters appear. The mild edge condition is an unelaborated domain assumption required for the main result.

axioms (2)
  • standard math A lattice polytope is the convex hull of finitely many points in the integer lattice Z^d.
    Foundational definition used to set up the 1-skeleton and toric ideal.
  • standard math The toric ideal of a lattice polytope is the kernel of the map sending variables to monomials indexed by the lattice points of the polytope.
    Standard construction of toric ideals from polytopes invoked throughout.
invented entities (1)
  • clique-face property no independent evidence
    purpose: To link cliques in the 1-skeleton graph to faces of the polytope and thereby characterize quadratic generation of the toric ideal.
    Newly defined concept that organizes the main theorems and applications.

pith-pipeline@v0.9.1-grok · 5736 in / 1698 out tokens · 73523 ms · 2026-06-30T10:31:26.500810+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 3 canonical work pages · 1 internal anchor

  1. [1]

    Aliniaeifard, C

    F. Aliniaeifard, C. Benedetti, N. Bergeron, S. X. Li, F. Saliola, Stable set polytopes and their 1-skeleta, preprint arXiv:1804.00360

    work page arXiv

  2. [2]

    Backman, N

    S. Backman, N. Cheung, M. Laso ´n, G. Liu, M. Michałek, The Gr¨obner Version of White’s Conjecture is False, arXiv:2606.13960

    work page arXiv

  3. [3]

    Barahona and A

    F. Barahona and A. R. Mahjoub, On the cut polytope,Math. Program.36(1986), 157–173

    1986

  4. [4]

    Bruns, J

    W. Bruns, J. Gubeladze and N. V . Trung, Normal polytopes, triangulations, and Koszul algebras,J. Reine Angew. Math.485(1997), 123–160

    1997

  5. [5]

    Chv´atal, On certain polytopes associated with graphs,J

    V . Chv´atal, On certain polytopes associated with graphs,J. Combin. Theory Ser. B18(1975), 138–154

    1975

  6. [6]

    J. A. De Loera, L. Ferroni, S. Morales and J. Rambau, There are matroid toric ideals without quadratic Gr ¨obner bases,arXiv:2606.11014

    work page internal anchor Pith review Pith/arXiv arXiv

  7. [7]

    Engst ¨om, Cut ideals ofK 4-minor free graphs are generated by quadrics,Michigan Math

    A. Engst ¨om, Cut ideals ofK 4-minor free graphs are generated by quadrics,Michigan Math. J.60(2011), 705– 714

    2011

  8. [8]

    Perfect Graphs Workshop

    H. Everett and B. A. Reed, Problem session on parity problems,in“Perfect Graphs Workshop”, Princeton Uni- versity, New Jersey, June 1993

    1993

  9. [9]

    Hausmann and B

    D. Hausmann and B. Korte, Colouring criteria for adjacency on 0-1 polyhedra, Math. Program. Stud.8(1978) 106–127

    1978

  10. [10]

    Binomial ideals

    J. Herzog, T. Hibi and H. Ohsugi, “Binomial ideals” Graduate Texts in Math.279, Springer, Cham, 2018

    2018

  11. [11]

    Linhares Sales, F

    C. Linhares Sales, F. Maffray and B. A. Reed, On planar perfectly contractile graphs,Graphs Combin.13(1997), 167–187

    1997

  12. [12]

    Matsuda, H

    K. Matsuda, H. Ohsugi, and K. Shibata, Toric rings and ideals of stable set polytopes,Mathematics7:613, 2019

    2019

  13. [13]

    Mori, Simplex faces of order and chain polytopes,Order42(2025) 805–810

    A. Mori, Simplex faces of order and chain polytopes,Order42(2025) 805–810

    2025

  14. [14]

    Ohsugi, A geometric definition of combinatorial pure subrings and Gr ¨obner bases of toric ideals of positive roots,Comment

    H. Ohsugi, A geometric definition of combinatorial pure subrings and Gr ¨obner bases of toric ideals of positive roots,Comment. Math. Univ. St. Pauli56(2007) 27–44

    2007

  15. [15]

    Ohsugi, J

    H. Ohsugi, J. Herzog and T. Hibi, Combinatorial pure subrings,Osaka J. Math.37(2000), 745–757

    2000

  16. [16]

    Ohsugi and T

    H. Ohsugi and T. Hibi, Toric ideals generated by quadratic binomials,J. Algebra,218(1999), 509–527

    1999

  17. [17]

    Ohsugi and T

    H. Ohsugi and T. Hibi, Indispensable binomials of finite graphs,J. Algebra Appl.,4(2005), 421–434

    2005

  18. [18]

    Proceedings of the 2008 International Conference on Information Theory and Statistical Learning (ITSL)

    H. Ohsugi and T. Hibi, Simple polytopes arising from finite graphs,in“Proceedings of the 2008 International Conference on Information Theory and Statistical Learning (ITSL)”, 2008

    2008

  19. [19]

    Ohsugi, K

    H. Ohsugi, K. Shibata and A. Tsuchiya, Perfectly contractile graphs and quadratic toric rings,Bull. Lond. Math. Soc.55(2023), 1264–1274

    2023

  20. [20]

    Ohsugi and A

    H. Ohsugi and A. Tsuchiya, Kempe equivalence and quadratic toric rings,J. Pure Appl. Algebra230(2026), 108257

    2026

  21. [21]

    J. G. Oxley, Matroid theory, volume 21 of Oxford Graduate Texts in Mathematics, Oxford University Press, Oxford, second edition, 2011

    2011

  22. [22]

    Reyes, C

    E. Reyes, C. Tatakis and A. Thoma, Minimal generators of toric ideals of graphs,Adv. Appl. Math.48(2012), 64–78

    2012

  23. [23]

    Sturmfels and S

    B. Sturmfels and S. Sullivant, Toric geometry of cuts and splits,Michigan Math. J.57(2008), 689–709. 14

    2008

  24. [24]

    Polytopes and graphs

    G. P. Villavicencio, “Polytopes and graphs”, Cambridge Stud. Adv. Math.211, Cambridge University Press, Cambridge, 2024

    2024

  25. [25]

    Villarreal, Rees algebras of edge ideals,Comm

    R.H. Villarreal, Rees algebras of edge ideals,Comm. Algebra23(1995), 3513–3524

    1995

  26. [26]

    Monomial Algebras

    R. H. Villarreal, “Monomial Algebras”, 2nd ed., Chapman & Hall/CRC, Boca Raton, FL, 2015

    2015

  27. [27]

    N. L. White, A unique exchange property for bases,Linear Algebra Appl.31(1980), 81–91

    1980

  28. [28]

    Whitney, Non-separable and planar graphs,Trans

    H. Whitney, Non-separable and planar graphs,Trans. Amer. Math. Soc.34(1932), 339–362

    1932

  29. [29]

    Lectures on 0/1-Polytopes

    G. M. Ziegler, “Lectures on 0/1-Polytopes”,InPolytopes - Combinatorics and Computation, (G. Kalai and G. Ziegler Eds) DMV Seminar, vol 29. Birkh¨auser, Basel, 2000. AKIMORI, CENTER FORPHYSICS ANDMATHEMATICS, INSTITUTE FORLIBERALARTS ANDSCIENCES, OSAKAELECTRO-COMMUNICATIONUNIVERSITY, NEYAGAWA, OSAKA572-8530, JAPAN Email address:a-mori@osakac.ac.jp HIDEFUMI...

    2000