Pith. sign in

REVIEW 3 major objections 5 minor 16 references

Binomial edge rings associated to skew Ferrers diagrams

T0 review · 3 major / 5 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read For every skew Ferrers diagram, the binomial edge ring over any field is Koszul, Cohen–Macaulay, and normal, with a quadratic Gröbner basis and dimension equal to the number of perimeter cells.

desk verdict Solid dimension formula and reduction machinery, but the main Sagbi/Gröbner theorem rests on an unverified lifting step that the authors themselves flag as incomplete. read the letter →

arxiv 2508.20364 v1 pith:ODS42B7S submitted 2025-08-28 math.AC math.CO

Kuei-Nuan Lin , Yi-Huang Shen This is my paper · ORCID
classification math.ACmath.CO MSC 13F6505E4014M25
keywords binomialedgeringskewFerrersdiagramSagbibasisGrobnerKoszulalgebraCohen-MacaulaynormaldomainKrulldimension
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

Binomial edge rings are generated by the 2×2 minors that a graph picks out from a 2×n matrix; this paper shows that when the graph comes from a skew Ferrers diagram, those rings are exceptionally well behaved. The authors construct an explicit set H of generators for the subalgebra and prove it is a Sagbi basis: its leading monomials generate a toric ring with a quadratic Gröbner basis, and every relation can be lifted back to the original ring. It follows that the binomial edge ring is Koszul, Cohen–Macaulay, and normal, with rational singularities in characteristic zero and F-rational in positive characteristic. The paper also counts the Krull dimension: it equals the number of cells on the northwest and southeast perimeter of the diagram. This extends a known result for complete bipartite graphs and gives a combinatorial handle on rings that arise in algebraic statistics.

What carries the argument

The central object is the set H: it consists of the defining binomials f_{i,j} together with the mixed products f_{i1,j1;i2,j2}, designed so that their leading monomials are x_i y_j for a cell and x_{i1} p_{j1} q_{i2} y_{j2} for a legitimate anti-diagonal pair. The machinery is the finite reduction system F on the monomials of the presentation ring R for K[LT(H)]—quadratic rewrites of types (I), (II), (III1), and (III2)—together with the χ-measure and a graded reverse lexicographic refinement that prove every reduction sequence terminates. The lifting principle from Sagbi theory then transfers the quadratic Gröbner basis from the initial algebra to the original binomial edge ring, and the pe

What would settle it

Take a small skew Ferrers diagram, for instance λ=(3,3,3) and μ=(1,1,0), and compute the reduced Gröbner basis of the defining ideal of its binomial edge ring with a computer algebra system. If the basis contains any generator of degree at least 3, or if the S-polynomial of two listed quadratic lifts reduces to a binomial not covered by the 13 case types, then the quadratic Gröbner basis claim fails; conversely, exhaustively checking all diagrams up to, say, 4×4 cells would test the exhaustive-cover claim directly.

Watch

Extended reading notes

Core claim

Let Γ=λ/μ be a skew Ferrers diagram and G=G_{λ/μ} the bipartite graph built from its cells. The binomial edge ring K[G(J_G)] is generated by the binomials f_{i,j}=x_i y_j−p_j q_i. The paper adds the auxiliary quadrics f_{i1,j1;i2,j2}=f_{i1,j1}f_{i2,j2}−f_{i1,j2}f_{i2,j1} and collects them in a set H. With the lexicographic order, H is a Sagbi basis: the leading terms of H generate the initial algebra K[LT(H)], and the defining ideal of K[LT(H)] has a quadratic Gröbner basis consisting of reductions of types (I), (II), (III1), and (III2). The paper then verifies case by case that every one of those quadratic binomials can be lifted to a quadratic binomial in the kernel presenting K[G(J_G)]; t

Load-bearing premise

The proof that the quadratic lifted binomials generate the full defining ideal rests on the claim that the 13 cases listed in Section 4.1, together with cases set aside by symmetry or because the start monomial is already standard, exhaust every quadratic reduction that can occur; if one case is missing, the quadratic Gröbner basis conclusion—and with it the Koszul, Cohen–Macaulay, and normality conclusions—would have no support.

Editorial extensions

If this is right

  • K[G(J_G)] is Koszul, Cohen–Macaulay, and normal for every skew Ferrers diagram; in characteristic 0 it has rational singularities, and in positive characteristic it is F-rational.
  • The defining ideal of K[G(J_G)] is generated in degree 2 and admits the explicitly listed quadratic Gröbner basis J, so homological and combinatorial invariants can in principle be read off from standard monomials.
  • The Krull dimension is #P, and for the rectangular complete bipartite case this becomes 2(a+b−2), recovering the known formula.
  • The standard monomials of the quadratic Gröbner basis give an explicit monomial basis of the quotient, allowing Hilbert series and Betti numbers to be computed directly from the diagram.

Reading between the lines

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

  • If the 13-case lifting taxonomy is exhaustive, the same proof strategy should apply to any bipartite graph whose cells satisfy the same NE–SW closure properties; testing this on 'almost Ferrers' diagrams would be a natural next step.
  • The explicit quadratic Gröbner basis could support algorithmic work on the conditional-independence models associated to skew Ferrers diagrams, for example by supplying a normal-form algorithm or a Markov basis.
  • The perimeter-cell dimension formula suggests that the dimension of Sagbi-degenerate binomial edge rings can be read from boundary paths; this may generalize to bipartite graphs with several connected components by summing boundary contributions.
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 / 5 minor

Summary. The paper studies the binomial edge ring K[G(J_G)] associated to a skew Ferrers diagram Γ, i.e., the K-subalgebra of S generated by the binomials f_{i,j}=x_i y_j - p_j q_i for cells (i,j)∈Γ, together with auxiliary quadratic polynomials f_{i1,j1;i2,j2}. The main result (Theorem 4.4) states that the set H is a Sagbi basis, that the defining ideal of K[G(J_G)] has a quadratic Gröbner basis J, and consequently the ring is Koszul, Cohen–Macaulay, normal, with rational singularities in characteristic 0 and F-rational in positive characteristic. Theorem 5.3 identifies the Krull dimension with the number #P of northwest and southeast perimeter cells of Γ. The proof strategy is to analyze the initial algebra K[LT(H)], construct a quadratic Gröbner basis F for ker(φ*), and then lift F to ker(φ) via Conca–Herzog–Valla.

Significance. If fully correct, the paper would give a substantial and nontrivial extension of Higashitani's theorem on binomial edge rings of complete bipartite graphs to the wider class of skew Ferrers diagrams. The authors introduce a combinatorial reduction system adapted to the non-closed bipartite graph, and the dimension formula in terms of perimeter cells is elegant and computable. The potential value for the field is real: it connects Sagbi basis theory, Gröbner bases, and combinatorial commutative algebra in a concrete setting. The main weakness is the incomplete lifting verification in Section 4.1, which is load-bearing for the central theorem. The manuscript also contains several presentation issues that should be fixed in revision.

major comments (3)
  1. [§4.1, Remark 4.3] The lifting verification is incomplete. Remark 4.3 explicitly states that 'the discussion above appears incomplete' and that omitted cases are excluded either by symmetry or because the monomial is already in standard form, but no proof is given that these two exclusions cover all quadratic binomials in F whose cell sets lie in Γ. Since Theorem 4.4(b) depends on lifting every element of the Gröbner basis F of ker(φ*) to ker(φ), a single missing case would undermine the quadratic Gröbner basis conclusion and, with it, the Koszul/Cohen–Macaulay/normal/rational-singularity results. The authors should provide a complete enumeration of all possible leading monomials of F and a systematic proof that the listed cases F1–F13 and F'_i cover them.
  2. [§4.1, case F13] Case F13 is dismissed with the sentence 'This case is identical to the case in (xii) by symmetry with respect to the anti-diagonal line.' This symmetry is not demonstrated. For a skew Ferrers diagram, reflection about the anti-diagonal does not generally preserve Γ, and the reduction (III1)/(III2) in Definition 3.5 depends on membership of a T-variable in R, so symmetry arguments require explicit justification. Please provide a direct verification or a precise symmetry statement with proof.
  3. [§3, Lemma 3.6 (III2)] The proof of the validity of the reduction (III2) relies on '9 subcases' illustrated in Figure 3, but the subcases are not enumerated or checked in the text. This reduction is used in Proposition 3.11 and in Theorem 3.14 to establish that F is a Gröbner basis for ker(φ*). The geometric description is plausible, but the proof should be made rigorous by listing the 9 configurations and verifying the claimed containment of the relevant rectangular regions in Γ, or by giving an alternative formal argument.
minor comments (5)
  1. [§2, Eq. (2) and Notation 2.3] The condition 'ui1 < j1 < j2 ≤ λi2' should read 'μ_{i1} < j1 < j2 ≤ λ_{i2}'. The same typo appears in the description of the variables of R in §3.
  2. [§5, proof of Theorem 5.3] In part (a), the index range 'a− b − 2' in 'For each k = 1, 2, . . . , a− b − 2' should be 'a+b−2'. As written, the range is wrong when a<b.
  3. [§3, Definition 3.1 and Remarks 3.3] The same symbol Γ is used for the original skew Ferrers diagram and for the ambient rectangular diagram. This is confusing; please use a distinct notation such as \(\overline{\Gamma}\) for the rectangular diagram.
  4. [References] References [10] and [11] appear to be the same article: 'Binomial edge ideals and conditional independence statements' by Herzog, Hibi, Hreinsdóttir, Kahle, and Rauh. The citation [11] in Remark 2.2 should likely be [10].
  5. [§4.1, cases F1–F13] The phrase 'the marked binomial' is used throughout, but the text does not visibly indicate which monomial is marked (e.g., by underlining or bold). Please make the leading monomial explicit in each F_i and F'_i, since the lifting argument depends on knowing which monomial is the initial term.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the derivation is self-contained; the only acknowledged caveat is an incompleteness note in the 13-case lifting analysis, not a circular step.

full rationale

The paper's central derivation is not circular. The Sagbi basis H and the auxiliary polynomials are defined directly from the skew Ferrers diagram, not from any assumed property of the binomial edge ring. The Gröbner basis of the initial algebra ker(phi*) is proved via the external Sturmfels theorem [16, Theorem 3.12] plus a termination argument (Proposition 3.11) that uses an explicit chi-potential, and the fiber-invariance proof in Theorem 3.14 is a self-contained combinatorial contradiction argument. The lift from ker(phi*) to ker(phi) relies on the standard Conca–Herzog–Valla lifting theorem [4] and on an explicit check of the 13 Higashitani cases, with replacements F'_3, F'_4, F'_9, F'_12. Remark 4.3 expressly concedes that this case discussion 'appears incomplete' and that omitted cases are dismissed by symmetry or by already being standard. That is a genuine completeness gap in the proof as written, but it is not circularity: the gap does not assume Theorem 4.4 or the target result as input; it merely leaves a universal quantifier unverified. The main structural input is the external lifting theorem, not a self-citation. The only self-citation, [1], appears in the introduction as contextual related work and is not load-bearing for any proof. The Krull dimension formula in Theorem 5.3 is derived by independent transcendence-degree computations from the initial algebra, not from the claimed dimension value. No parameter is fitted, no known result is renamed, and no uniqueness theorem is imported to force a choice. The acknowledged incompleteness in Section 4.1 is a correctness/completeness risk, not a circularity risk, so under the hard rules it should not raise the circularity score.

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

No numerical fits or external data appear. The paper introduces auxiliary polynomials H, reductions F, closures cl(Z), and the chi-measure, but these are proof devices rather than postulated entities. The main unproved combinatorial load is the exhaustiveness of the 13-case lift, counted under axioms.

assumptions (5)
  • standard math The lex order defined by x1 > ... > xa > p1 > ... > pb > q1 > ... > qa > y1 > ... > yb makes the underlined monomials of equations (1) and (2) the leading terms.
    Used throughout to define LT(H); verified by inspection from the variable ordering and the form of the binomials.
  • standard math Sturmfels [16, Theorem 3.12]: a Noetherian reduction system compatible with a product of a coarse nonnegative measure and a total order yields a Grobner basis for the ideal generated by the reductions.
    Invoked in Proposition 3.11 and Theorem 3.14 to conclude that F is a Grobner basis for the ideal it generates.
  • standard math Conca-Herzog-Valla [4, Prop 1.1, Cor 2.1-2.3]: a lifting of the Grobner basis of the initial algebra gives a Sagbi basis and preserves normality, Cohen-Macaulayness, and singularity properties.
    Used in the proof of Theorem 4.4 to pass from the initial algebra K[LT(H)] to the binomial edge ring K[G(J_G)].
  • ad hoc to paper The 13 cases in Section 4.1 together with the symmetry and standard-form exclusions in Remark 4.3 cover all quadratic binomials of ker(phi*) supported in Γ.
    This is the completeness assertion the paper does not fully prove; Remark 4.3 acknowledges the case analysis appears incomplete and leaves omitted cases to symmetry or standard form without enumeration.
  • domain assumption In an edge-connected skew Ferrers diagram with mu_a = 0, the NW perimeter cells form a path from (1,b) to (a,1) of length a+b-1.
    Used in the proof of equation (5) in Theorem 5.3; stated as clear from the diagram rather than proved in detail.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Binomial edge rings associated to skew Ferrers diagrams." pith.science (2026). https://pith.science/paper/ODS42B7S

@misc{pith2026250820364,
  author       = {Pith},
  title        = {Pith review of: Binomial edge rings associated to skew Ferrers diagrams},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ODS42B7S}},
  note         = {Machine review of arXiv:2508.20364}
}
read the original abstract

In this study, we investigate the binomial edge ring associated with the skew Ferrers diagram. By employing Sagbi basis theory, we construct a quadratic Gr\"{o}bner basis for its defining ideal. As an application, we prove that this ring is a Koszul, Cohen-Macaulay, normal domain. Moreover, we precisely determine its Krull dimension.

Figures

Figures reproduced from arXiv: 2508.20364 by the authors.

Figure 1
Figure 1. The skew diagram λ/µ with λ = (6, 5, 5, 3) and µ = (2, 1, 0, 0) For the aforementioned bipartite graph G, we introduce the polynomial ring S = K[x, p, q, y] over a field K, with variables ordered as x1 > x2 > · · · > xa > p1 > p2 > · · · > pb > q1 > q2 > · · · > qa > y1 > y2 > · · · > yb. The lexicographic order on S induced by this variable ordering is denoted by >lex. The binomial edge ideal JG of the bipartite gr… view at source ↗
Figure 2
Figure 2. Rectangular regions (ii) The legitimate strictly NE-compatible pair ((i, j),(i ′ , j′ )) in Γ corresponds bijec￾tively to the variable Ti,j′ ;i ′ ,j in R. More precisely, this legitimate pair creates a rectangular region in Γ, in which they are anti-diagonal corners. The coordinates of the diagonal corners of this region emerge in turn as the subscripts of the T variable. Example 3.4. In the skew Ferrers diagram Γ d… view at source ↗
Figure 3
Figure 3. Condition for Tmin{i1,i′ 1 },j′ 1 ;i ′ 2 ,max{j1,j′ 2 } ∈/ R Notation 3.7. (a) We also denote Ti,j as Ti,−∞;+∞,j , thereby ensuring that every variable in R formally bears a subscript in the form of a 4-tuple. To maintain consistency with the homomorphism φ ∗ introduced at the beginning of Section 3, we also denote p−∞ and q+∞ as the identity element 1 in S. (b) Given E := (i1, j1;i2, j2) ∈ (Z ∪ {±∞}) 4 , let X YE :… view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Sum of χ-values To establish the result regarding the Gr¨obner basis, we still need the final piece of the puzzle that guarantees the convergence of the reduction process. Definition 3.9. For any two cells A, B ∈ Z 2 ∪ {(+∞, −∞)}, we define χ(A, B) as 0 if A and B are …
Figure 5
Figure 5. Figure 5: Closures of two sets of cells Throughout this discussion, we consistently assume the following index ranges: 1 ≤ i, i′ , e, e′ ≤ a and 1 ≤ j, j′ , f, f′ ≤ b, with the constraints i < i′ , e < e′ , j ′ < j and f ′ < f. Moreover, in each specified polynomial F∗, the firs…
Figure 6
Figure 6. Figure 6: Perimeter cells The final theorem of this work is stated as follows. Theorem 5.3. The Krull dimension of K[G(JG)] is equal to the cardinality #P [PITH_FULL_IMAGE:figures/full_fig_p014_6.png]
Figure 7
Figure 7. Figure 7: The diagrams Γ′ and Γ′′ We can easily recover the dimensional result in [12, Corollary 1.3] from Theorem 5.3. Corollary 5.5. If the Ferrers graph G is complete bipartite, then dim(K[G(JG)]) = 2(a+b−2). Proof. In this configuration, Γ represents an a×b diagram. The card…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

  1. [1]

    Almousa, K.-N

    A. Almousa, K.-N. Lin, and W. Liske, Rees algebras of unit interval determinantal facet ideals , J. Pure Appl. Algebra 228 (2024), Paper No. 107601, 15

    work page 2024

  2. [2]

    Bruns and J

    W. Bruns and J. Herzog, Cohen-Macaulay rings. , Rev. ed., Camb. Stud. Adv. Math., vol. 39, Cambridge: Cambridge University Press, 1998 (English)

    work page 1998

  3. [3]

    Bruns and U

    W. Bruns and U. Vetter, Determinantal rings , Lecture Notes in Mathematics, vol. 1327, Springer-Verlag Berlin Heidelberg, 1988

    work page 1988

  4. [4]

    Conca, J

    A. Conca, J. Herzog, and G. Valla, Sagbi bases with applications to blow-up algebras , J. Reine Angew. Math. 474 (1996), 113–138

    work page 1996

  5. [5]

    Corso and U

    A. Corso and U. Nagel, Monomial and toric ideals associated to Ferrers graphs , Trans. Amer. Math. Soc. 361 (2009), 1371–1395

    work page 2009

  6. [6]

    Corso, U

    A. Corso, U. Nagel, S. Petrovi´ c, and C. Yuen,Blow-up algebras, determinantal ideals, and Dedekind–Mertens- like formulas , Forum Math. 29 (2017), 799–830

    work page 2017

  7. [7]

    Diaconis, D

    P. Diaconis, D. Eisenbud, and B. Sturmfels, Lattice walks and primary decomposition , Mathematical essays in honor of Gian-Carlo Rota (Cambridge, MA, 1996), 1998, pp. 173–193

    work page 1996

  8. [8]

    Ene and J

    V. Ene and J. Herzog, Gr¨ obner bases in commutative algebra, Graduate Studies in Mathematics, vol. 130, American Mathematical Society, Providence, RI, 2012

    work page 2012

Show all 16 references
  1. [9]

    Fulton and P

    W. Fulton and P. Pragacz, Schubert varieties and degeneracy loci , Lecture Notes in Mathematics, vol. 1689, Springer-Verlag, Berlin, 1998. Appendix J by the authors in collaboration with I. Ciocan-Fontanine

    1998

  2. [10]

    Herzog, T

    J. Herzog, T. Hibi, F. Hreinsd´ ottir, T. Kahle, and J. Rauh,Binomial edge ideals and conditional independence statements, Adv. in Appl. Math. 45 (2010), 317–333

    2010

  3. [11]

    , Binomial edge ideals and conditional independence statements , Adv. in Appl. Math. 45 (2010), 317–333

    2010

  4. [12]

    Higashitani, Binomial edge rings of complete bipartite graphs (2024), available at arXiv:2411.07812

    A. Higashitani, Binomial edge rings of complete bipartite graphs (2024), available at arXiv:2411.07812

    2024 arXiv

  5. [13]

    Hochster, Rings of invariants of tori, Cohen-Macaulay rings generated by monomials, and polytopes , Ann

    M. Hochster, Rings of invariants of tori, Cohen-Macaulay rings generated by monomials, and polytopes , Ann. of Math. (2) 96 (1972), 318–337

    1972

  6. [14]

    Laclair, M

    A. Laclair, M. Mastroeni, J. McCullough, and I. Peeva, Koszul binomial edge ideals , 2025. Preprint

    2025

  7. [15]

    Ohtani, Graphs and ideals generated by some 2-minors , Comm

    M. Ohtani, Graphs and ideals generated by some 2-minors , Comm. Algebra 39 (2011), 905–917

    2011

  8. [16]

    Sturmfels, Gr¨ obner bases and convex polytopes, University Lecture Series, vol

    B. Sturmfels, Gr¨ obner bases and convex polytopes, University Lecture Series, vol. 8, American Mathematical Society, Providence, RI, 1996. Department of Mathematics, The Penn State University, McKeesport, PA, 15132, USA Email address : linkn@psu.edu School of Mathematical Sci...

    1996

Pith tools

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