Pith. sign in

REVIEW 1 major objections 9 references

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux

T0 review · 1 major / 0 minor · reviewed 2026-05-24 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗

Pith's one-line read Explicit order matchings are constructed for the posets L(3,n) and L(4,n) using chain tableaux and greedy algorithms.

desk verdict Explicit matchings for L(3,n) and L(4,n) via chain tableaux are new but the completeness argument for L(4,n) is thin. read the letter →

arxiv 2104.11003 v2 submitted 2021-04-22 math.CO

Guoce Xin , Yueming Zhong This is my paper
classification math.CO
keywords Young'slatticeSpernerpropertyordermatchingchaindecompositiontableauxgreedyalgorithmpartitionposet
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 seeks a direct combinatorial proof of the Sperner property for Young's lattices L(m,n) by building explicit order matchings that pair elements between consecutive ranks. It succeeds for m=3 and m=4 by introducing chain tableaux to represent the partitions and applying a greedy algorithm to select the matchings. The same matchings also arise from a recursive kneading process. A sympathetic reader would care because the construction gives an explicit chain decomposition rather than an existence proof, settling the matching problem for these rectangle sizes.

What carries the argument

The chain tableau representation, a way to encode partitions inside an m by n rectangle so that a greedy selection produces a perfect order matching between ranks.

What would settle it

An explicit n and rank k where the greedy matching on the chain tableaux leaves more than zero unmatched elements in the smaller of the two rank levels.

Watch

Extended reading notes

Core claim

We construct explicit order matchings for L(3,n) and L(4,n) by means of a chain tableau representation; the matchings can be obtained independently via a greedy algorithm and via a recursive kneading process, yielding explicit Sperner chain decompositions for these posets.

Load-bearing premise

The chain tableaux and greedy rule produce a perfect matching between every pair of consecutive ranks for every n, with no unmatched elements or order violations.

Editorial extensions

If this is right

  • L(3,n) and L(4,n) admit explicit Sperner chain decompositions for all n.
  • The greedy algorithm and the recursive kneading process generate identical matchings.
  • The chain tableau supplies a uniform language for describing the matchings in both cases.

Reading between the lines

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

  • If similar tableau rules can be written for m greater than 4, the same greedy construction might produce matchings there as well.
  • The method supplies a concrete way to compute the matching for any fixed n and to check the order-preserving property by hand or machine.
  • The tableaux may reveal patterns that connect to other rank-symmetric posets where explicit matchings are sought.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 0 minor

Summary. The paper claims to construct explicit order matchings (Sperner chain decompositions) for the posets L(3,n) and L(4,n) in Young's lattice L(m,n). It introduces a chain tableau representation to characterize the matchings and asserts that the same matchings arise from both a greedy algorithm and a recursive kneading process, thereby giving direct combinatorial proofs of the Sperner property for these cases.

Significance. If the constructions are shown to be complete and correct, the result would resolve a long-standing open problem by supplying explicit matchings for m=3 and m=4, where only non-constructive existence proofs were previously available. The chain tableau formalism is presented as a new structural tool that might extend to larger m.

major comments (1)
  1. [Construction sections (greedy algorithm and chain tableaux)] The central claim requires that the chain-tableau rules plus greedy selection produce a perfect matching between every pair of consecutive ranks for every n. The construction is presented via explicit local rules and a recursive kneading process, but the text supplies no separate argument (induction, injection, or counting) showing that every partition is reached exactly once and that no rank is left with unmatched elements. This is load-bearing for the assertion that the matchings are complete for all n, including large n in L(4,n).

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and for identifying this important point about the completeness of the construction. We address the major comment below.

read point-by-point responses

  1. Referee: [Construction sections (greedy algorithm and chain tableaux)] The central claim requires that the chain-tableau rules plus greedy selection produce a perfect matching between every pair of consecutive ranks for every n. The construction is presented via explicit local rules and a recursive kneading process, but the text supplies no separate argument (induction, injection, or counting) showing that every partition is reached exactly once and that no rank is left with unmatched elements. This is load-bearing for the assertion that the matchings are complete for all n, including large n in L(4,n).

    Authors: We agree that the manuscript would benefit from an explicit, self-contained argument establishing that the chain-tableau rules together with the greedy and kneading constructions yield a perfect matching for every n. While the recursive kneading process is defined so as to generate the decomposition inductively from smaller rectangles, and the chain tableaux are presented as a bijective representation, no separate induction, injection, or double-counting argument is supplied in the current text. In the revised version we will add a dedicated subsection containing an inductive proof on n. The induction will verify that, at each step, the local rules match every element in the current rank exactly once with an element in the next rank, with the base cases for small n checked directly and the inductive step using the recursive structure of the kneading process to preserve completeness and uniqueness for both L(3,n) and L(4,n). revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: explicit algorithmic constructions for matchings

full rationale

The paper describes a direct combinatorial construction of order matchings for L(3,n) and L(4,n) via chain tableaux, a greedy algorithm, and a recursive kneading process. No equations fit parameters to data subsets, no 'predictions' are derived from fitted inputs, and no uniqueness theorems or ansatzes are imported via self-citation. The central claim is an explicit algorithmic procedure whose correctness is asserted by the construction rules themselves; the provided abstract and context contain no self-referential definitions or load-bearing self-citations that reduce the result to its own inputs. This is a standard self-contained constructive proof in combinatorics.

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

Abstract supplies no mathematical details, so the ledger is empty.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux." pith.science (2026). https://pith.science/paper/2104.11003

@misc{pith2026210411003,
  author       = {Pith},
  title        = {Pith review of: Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2104.11003}},
  note         = {Machine review of arXiv:2104.11003}
}
abstract

Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and Sperner; however, finding a direct combinatorial proof via an explicit order matching remains a prominent open problem in the field. In this paper, we address this challenge by constructing explicit order matchings for $L(3,n)$ and extending our methods to comprehensively cover $L(4,n)$. To achieve this, we introduce a novel ``chain tableau" representation, which serves as a powerful tool for identifying and characterizing complex combinatorial patterns. Notably, we demonstrate that the same order matchings can be independently derived using both a greedy algorithm and a recursive kneading process. This work not only resolves the explicit matching problem for $m=3$ and $m=4$ but also establishes robust structural tools that may offer valuable insights into the general $L(m,n)$ case.

Figures

Figures reproduced from arXiv: 2104.11003 by the authors.

Figure 1
Figure 1. The tableaux of the chain decomposition of L(3, 8) under ϕ. C4k ,2k ,0 ... 1 ... ... 2 ... ... 3 ... ... 4k A  3n 12k A 2 k4,2,0, k  0，1，2， 2k n  4k 2k n  4k 4k A1 A n  4k [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗
Figure 2
Figure 2. Chain tableaux of Type i) starting at µ = (4k, 2k, 0), where A = 3n − 12k. We give two proofs of the theorem. The second proof will be given in the next section. The first proof need the following Lemma. Lemma 12. We have the following facts: (A1) If λ = (4k + c, 2k + c, c), k > 0, c > 0, then λ ∈ E3,λ1 . (A2) If λ = (4k + c + 1, 2k + c, c), k > 1, c > 0, then λ /∈ E3,λ1 ,λ2 + λ3 ≡ 0 (mod 2) and (λ1 − 1, λ2 + 1, λ3)… view at source ↗
Figure 3
Figure 3. Chain tableaux of Type ii) starting at µ = (4k, 2k, `) where ` ≥ 2 and B = 2n + 4` − 8k − 2. (A3) If λ = (4k +c+ 1, 2k +c+ 1, c), k > 1, c > 0, then λ /∈ E3,λ1 , λ2 +λ3 6≡ 0 (mod 2) and (λ1 − 1, λ2, λ3 + 1) ∈/ E3,λ1−1. (B2) If λ = (4k + `, 2k + c, c), k > 0, 1 6 c 6 ` − 2, ` > 2, then λ /∈ E3,λ1 ,λ2 + λ3 ≡ 0 (mod 2) and (λ1 − 1, λ2 + 1, λ3) ∈/ E3,λ1−1. (B3) If λ = (4k+`, 2k+c+1, c), k > 0, 1 6 c 6 `−3, ` > 2, then λ… view at source ↗
Figures from the paper (20 more)
Figure 6
Figure 6. Figure 6: Compare it with our chain decompositions in Figure 7. In both examples, the [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 4
Figure 4. Figure 4: The tableaux for Lindstr¨om’s chain decompositions of L(3, 6). 1 4 7 10 13 16 2 5 8 11 14 17 3 6 9 12 15 18 C 1 4 2 5 3 6 C42 1 3 5 7 2 4 6 8 C2 5 7 9 1 3 4 6 8 10 2 C3 7 9 1 3 5 6 8 10 2 4 C4 9 1 3 5 7 8 10 2 4 6 C5 1 3 5 7 9 10 2 4 6 8 C6 1 2 C62 L(3,6) [PITH_FULL_…
Figure 5
Figure 5. Figure 5: The tableaux for our chain decompositions of L(3, 6). 3 4 7 8 1 2 5 6 C02 1 2 3 4 5 6 7 8 1 2 3 4 C01 1 2 3 5 6 7 8 9 4 10 D00 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 C00 1 2 3 4 C10 2 4 1 3 L(4,4) [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: The tableaux for West’s chain decompositions of L(4, 4). Theorem 11 indeed give a Sperner chain decomposition of L(3, n). Its first proof relies on the order matching ϕ. We give a self-contained proof and extend the result for L(4, n) [PITH_FULL_IMAGE:figures/full_fig…
Figure 7
Figure 7. Figure 7: The tableaux for our chain decompositions of L(4, 4). 4.1. A direct proof for the chain decomposition of L(3, n). We need the following classification of L(3, n) in 7 types. Lemma 13. Any element λ = (λ1, λ2, λ3) in L(3, n) can be uniquely expressed in one of the follo…
Figure 11
Figure 11. Figure 11: Partitions in these chains will be called of type [PITH_FULL_IMAGE:figures/full_fig_p013_11.png]
Figure 8
Figure 8. Figure 8: The tableaux of all L(4, 8) chains. A1) (6k + c, 4k + c, 2k + c, c), k > 0, n − 6k > c > 0. A2) (6k + c + 1, 4k + c, 2k + c, c), k > 0, n − 6k − 1 > c > 0. A3) (6k + c + 1, 4k + c + 1, 2k + c, c), k > 0, n − 6k − 1 > c > 0. A4) (6k + c + 1, 4k + c + 1, 2k + c + 1, c), …
Figure 9
Figure 9. Figure 9: Chain tableaux of Type i) starting at µ = (6k, 4k, 2k, 0), k ∈ N, where A = 4n − 24k. ... ... 1 5 ... ... ... 3 7 ... ... ... 2 6 ... ... 4 8 ... ... 6k k6,4,2 l1,1,0,l  1, k  00,0,0 l 4k l 2k n  6k  l 6k  l n  6k  l 4k  l 2k B B = 4n -24k - 4l B -2 B…
Figure 10
Figure 10. Figure 10: Chain tableaux of Type ii) starting at µ = (6k+`, 4k+`, 2k, 0), k ∈ N,` ≥ 2, where B = 4n − 24k − 4`. ... ... ... ... 1 4 7 ... ... ... ... 2 5 8 ... ... ... 3 6 9 ... ... 4k 6k r r  2 k6,4,2 r1,0,0,r  2 2k 3r 8 3r 7 3r 6 3r 5 3r  4 3r 3 3r  2 3r 1 3r…
Figure 11
Figure 11. Figure 11: Chain tableaux of Type iii) starting at µ = (6k + r, 4k, 2k, 0), k ∈ N,r ≥ 2, where C = 3n − 18k − 2. ... ... ... ... ... ... ... ... ... ... 1 3 ... ... ... 2 4 ... ... 6k 4k l l  2 k6,4,2 l1,1,0 r1,0,0, k  N,l  0，1,r  2 l 2l 5 2l  4 2l 3 2l  2 2l …
Figure 12
Figure 12. Figure 12: Chain tableaux of Type iv) starting at µ = (6k + r + `, 4k + `, 2k, 0), k ∈ N,r ≥ 2,` ≥ 2, where D = 2` + 2r − 7 and E = 2n − 12k − 5 [PITH_FULL_IMAGE:figures/full_fig_p016_12.png]
Figure 13
Figure 13. Figure 13: The α, β, γ values for different types [PITH_FULL_IMAGE:figures/full_fig_p017_13.png]
Figure 14
Figure 14. Figure 14: Proof of the distinction of partitions from different types. 5. Recursive Sperner chain decompositions of L(m, n) A basic idea is that by using the dual operation, we only need the upper half part of L(m, n) to construct the a Sperner chain decomposition. Definition 1…
Figure 15
Figure 15. Figure 15: Determine the types from the α, β, γ values. {λi,1, i = 1, 2, · · · , k} is the starting set for the chain decomposition, {λ ∗ i,1 , i = 1, 2, · · · , k} is the end point set of the chain decomposition. Proof. we discuss the parity of mn as follows. (1). When mn is ev…
Figure 16
Figure 16. Figure 16: From the types and α, β, γ values to the partitions. 3 21 4 31 22 2 11 5 41 32 1    5,2L U C4 C2 C0 3 21 4 31 22 2 11 5 41 32 1    8,2L U C4 C2 C0 6 51 42 33 7 61 52 43 8 71 62 53 44 C8 C6 The U-decomposition of The U-decomposition of [PITH_FULL_IMAGE:figures/f…
Figure 18
Figure 18. Figure 18: The knead process for L(3, 3). 5.1. The recursive construction. To decompose L U (m, n), we use the natural recur￾sion L(m, n) = L(m, n−1) U (n⊕L(m−1, n)), where n⊕(λ1, . . . , λm−1) = (n, λ1, . . . , λm−1) and n ⊕ L(m − 1, n) = {n ⊕ λ : λ ∈ L(m − 1, n)}. Algorithm Re…
Figure 19
Figure 19. Figure 19: Step 1 3 21 4 31 22 2 11 5 41 32 1  5 2 152 5,2      d  3 21 4 31 22 2 11 5 41 32 51 5 5 5 5 5 5 5 5 5 5 5 8 2 153 5,3      d  The chains of 5 ⊕L(2,5) S L U The U-decomposition of (2,5) [PITH_FULL_IMAGE:figures/full_fig_p022_19.png]
Figure 20
Figure 20. Figure 20: Step 2 3 21 2 11 1 3 21 111 4 31 22 211 2 11 41 311 32 221 1  42 411 321 33 222 421 331 43 322 422 431 44 332 5 5 5 5 5 5 8 2 153 5,3      d  8 2 153 5,3      d  S E knead [PITH_FULL_IMAGE:figures/full_fig_p022_20.png]
Figure 21
Figure 21. Figure 21: Step 3 Output: The set Sm,n of starting partitions for a possible Sperner chain decomposition of L(m, n) [PITH_FULL_IMAGE:figures/full_fig_p022_21.png]
Figure 22
Figure 22. Figure 22: Step 4 (1) Let Em,n−1 = S ∗ m,n−1 be the set of end partitions of a Sperner chain decom￾position of L(m, n − 1). Select all partitions of rank less than dm,n to form E = {α 1 , . . . , αe}. (2) Let S = n LSm−1,n = {β1, β2, . . . }. (3) Add 1 to the first entry for eac…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

9 extracted references · 9 canonical work pages

  1. [1]

    A partition ofL(3,n ) into saturated chains

    Bernt Lindstr¨ om. A partition ofL(3,n ) into saturated chains. European J.Combin., 61–631, (1980)

    work page 1980

  2. [2]

    Kathleen M. O’Hara. Unimodality of Gaussian coefficients: a constructive proof. J. Combin. Theory Ser. A, 29–52, 53 (1990)

    work page 1990

  3. [3]

    Richard P. Stanley. Algebraic Combinatorics: Walks, Trees, Tableaux, and More. Springer, (2013)

    work page 2013

  4. [4]

    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, 2010

    work page 2010

  5. [5]

    Richard P. Stanley. Weyl groups, the hard Lefscheta theorem, and the Sperner property, SIAM J. Algebr. Discrete Math. 1, 168–184 (1980)

    work page 1980

  6. [6]

    Sylvester

    James J. Sylvester. Proof of the hitherto undemonstrated fundamental theorem of invariants. Phil. Mag. 178–188, 5 (1878); Collected Mathematical Papers, Chelsea, New York, 117–126, vol. 3 (1973)

    work page 1973

  7. [7]

    X. Wen. Computer-generated symmetric chain decompositions for L(4,n ) and L(3,n ). Advances in Applied Mathematics, 33(2): 409–412, 2004. 26 GUOCE XIN 1 AND YUEMING ZHONG 2

    work page 2004

  8. [8]

    Douglas B. West. A Symmetric chain decomposition of L(4,n ). European J. Combin., 379–383,1 (1980)

    work page 1980

Show all 9 references
  1. [9]

    Kathy O’Hara’s Constructive proof of the Unimodality of the Gaussian Polyno- mials

    Doron Zeilberger. Kathy O’Hara’s Constructive proof of the Unimodality of the Gaussian Polyno- mials. American Mathematical Monthly, 590–602, 96 (1989). 1School of Mathematical Sciences, Capital Normal University, Beijing 100048, PR China, 2School of Mathematical Sciences, Cap...

    1989

Pith tools

Reviewed May 24, 2026 · model on record in the stance chip above.