REVIEW 1 major objections 4 minor 20 references
An exceptional equinumerosity of lattice paths and Young tableaux
T0 review · 1 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash
Pith's one-line read The paper proves an explicit bijection between first-quadrant lattice paths and standard Young tableaux of near-hook shape (n+2,2,1^n).
desk verdict A correct and clean bijection between P_n and SYT((n+2,2,1^n)); the paper needs minor repairs, not a rewrite. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the arm-leg-heart decomposition of the near-hook shape $\theta(n)=(n+2,2,1^n)$: the first row is the arm, the first column is the leg, and the single remaining box at row 2, column 2 is the heart. Since every tableau has exactly one heart, the associated path automatically has exactly one backward step; since the entry 1 always occupies the arm-leg corner, it can be ignored, and the index shift $i\mapsto i+2$ reconciles the $2n+2$ path steps with the $2n+4$ tableau entries. The rule (3.1) is the mechanism that turns this decomposition into a bijection.
What would settle it
Enumerate the paths in $\mathcal{P}_2$, which number 90, apply the inverse rule $\phi$ to each, and check that every resulting filling of shape $(4,2,1,1)$ has strictly increasing rows and columns; a single violation disproves Theorem 3.1. In particular, for a path whose backward step is $W$, the heart value must exceed both the second arm entry and the second leg entry, so one can search specifically for a path where this fails.
Extended reading notes
Core claim
The central claim is Theorem 3.1: the map $\psi:\mathrm{SYT}(\theta(n))\to\mathcal{P}_n$ given by (3.1) is a bijection. For a tableau $T$, $\psi(T)=p_1\cdots p_{2n+2}$ is defined by $p_i=E$ when $i+2$ lies in the arm, $p_i=N$ when $i+2$ lies in the leg, and $p_i=S$ or $W$ when $i+2$ is the heart, with $S$ chosen exactly when 2 is in the arm and $W$ exactly when 2 is in the leg. The proof shows the resulting word is a valid path with the right endpoint and the correct quadrant behavior, notes that injectivity is immediate, and obtains surjectivity from an inverse map $\phi$ that fills the arm with the E-positions plus possibly 2, the leg with the N-positions plus possibly 2, and the heart with the shifted index of the unique backward step. The paper also states, without proof, a second bijection $\xi$ in Proposition 4.1, whose backward step is governed by the predecessor of the heart entry rather than by the position of 2.
Load-bearing premise
The proof's surjectivity half rests on the assertion, left as a 'straightforward' check, that the inverse map $\phi$ always produces a valid standard Young tableau; if some allowed path decoded to a filling whose row or column increases failed, the bijection would be false.
Editorial extensions
If this is right
- The bijection gives a constructive, bijective proof that $|\mathcal{P}_n| = |\mathrm{SYT}(\theta(n))|$ for every $n$, without relying on the hook-length formula for the equality.
- Every lattice path in $\mathcal{P}_n$ can be decoded into exactly one standard Young tableau of shape $(n+2,2,1^n)$, so the inverse map provides a new way to build tableaux from path words.
- Because a second bijection $\xi$ also works, the correspondence is not an isolated accident; several natural rules relate the same two families.
- The authors suggest that the Specht module for shape $\theta(n)$ deserves further combinatorial study in light of the bijection.
Reading between the lines
- One testable extension would be to compute the distribution of a simple path statistic, such as the position of the backward step or the number of peaks, under $\psi$ and compare it with a standard tableau statistic such as descent number; the paper does not attempt this.
- If $\psi$ or $\xi$ can be made equivariant for a cyclic action on paths, such as rotation or complementation, and for Schützenberger promotion on tableaux, the pair would yield a cyclic sieving phenomenon for $\mathrm{SYT}(\theta(n))$; this is speculation beyond the paper.
- The near-hook shape $\theta(n)$ and the fact that the number of boxes exceeds the path length suggest the correspondence may pass through a third family, perhaps of partial matchings or decorated Dyck paths, that naturally tracks the omitted entry 1; that intermediate family is not proposed by the paper.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper defines a family P_n of lattice paths from (0,0) to (n,n) of length 2n+2 using N, S, E, W steps that stay weakly in the first quadrant. It proves, by an explicit map psi, that |P_n| equals |SYT((n+2,2,1^n))|, a shape called theta(n). The map psi reads a standard Young tableau by recording, for each entry i >= 3, an E/N step according to whether i lies in the first row (arm) or first column (leg); the unique heart entry determines the step S or W, with the location of 2 deciding which. The core of the paper is Theorem 3.1, asserting that psi is a bijection. The proof carefully establishes that psi(T) is a lattice path with the correct endpoint and quadrant confinement, and states that injectivity is clear. Surjectivity is delegated to an inverse map phi described in the final paragraph, whose well-definedness is asserted but not verified. The paper also sketches a second bijection xi in Section 4, stated as Proposition 4.1 without proof.
Significance. If the omitted inverse verification is supplied, the paper gives a genuinely constructive and elementary bijection for an equinumerosity that had previously been observed only through coinciding enumeration formulas. This is a worthwhile contribution to the literature on exceptional bijections for standard Young tableaux, and it opens a concrete direction for representation-theoretic study of the Specht module for theta(n). The well-definedness proof for psi is careful and uses the actual entries of the tableau, and the quadrant-confinement argument is sound. The central construction is attractive and likely correct; the main issue is the missing verification of the inverse map, which is load-bearing for the claimed bijection.
major comments (1)
- [Proof of Theorem 3.1, final paragraph] Surjectivity of psi rests entirely on the assertion that the inverse map phi always produces a valid standard Young tableau, yet the verification is omitted. Concretely, for P in P_n with unique backward step p_j = S, the value j+2 placed in the heart must be larger than the entry in the second row, first column (the smallest leg value among {i+2 : p_i = N}) and larger than the arm entry immediately above it; for p_j = W the analogous inequalities with the entry above the heart must hold. These inequalities are true, but they follow from the first-quadrant condition in the form that the unique backward step must be preceded by a forward step of the same axis, and this argument is not given. The paragraph also leaves implicit that the arm and leg entries are placed in increasing order and that 2 is inserted in the appropriate row or column; without those conventions the description of phi is incomplete. The author should expand this final paragraph into a full verification of well-definedness, including the mutual-inverse statement. This is not a cosmetic gap: if any path violated the required inequalities, phi would output a non-standard tableau and the bijection would fail.
minor comments (4)
- [Section 4.1, Proposition 4.1] Proposition 4.1 is stated as a theorem with a proof-symbol but no proof is provided, and the surrounding text says the additional bijections are 'described without proof.' Please either prove this proposition or explicitly label it as a conjecture/observation rather than a proposition.
- [Proof of Theorem 3.1, injectivity sentence] The statement 'The injectivity of psi is clear' can be made precise in one sentence: the path P determines the sets of arm and leg entries as {i+2 : p_i = E} and {i+2 : p_i = N}, the heart entry as j+2 for the unique backward step p_j, and the location of 2 by whether p_j is S or W, so T is uniquely reconstructed from P. Spelling this out would also support the mutual-inverse claim.
- [Introduction] There is a typo in the introduction: 'correspondance' should be 'correspondence.'
- [Figure 1 caption] The caption says 'The 16 standard Young tableaux in SYT(theta(1))'; for consistency with the notation used elsewhere, consider writing SYT(theta(1)) explicitly or adding a parenthetical that n = 1 in the figure.
Circularity Check
No circularity: the bijection in Theorem 3.1 is constructed directly from definitions and does not rely on the enumeration formulas or self-citations.
full rationale
The paper's central claim, Theorem 3.1, is an explicit bijection between standard Young tableaux of shape θ(n) and the lattice path set P_n. The forward map ψ is defined directly from the positions of entries in the tableau: each value i+2, for 3 ≤ i ≤ 2n+4, is converted to E, N, S, or W according to whether i+2 lies in the arm, leg, or heart, with the backwards step type determined by the location of the entry 2. The proof then checks, using only the standard increasingness of the tableau, that the resulting word has the correct number of N, E, S, W steps and stays in the first quadrant. Injectivity is immediate because the positions of the entries are recoverable from the path, and surjectivity is addressed by defining an inverse map φ that places path values back into the tableau. No parameter is fitted, no enumeration formula is used as an input to the bijection proof, and no load-bearing self-citation appears. The only evident weakness is not circularity: the final paragraph of the proof of Theorem 3.1 asserts that the inverse construction produces a valid standard Young tableau and that φ and ψ are mutually inverse, calling the check 'straightforward' without supplying the details. That is an omitted verification, not a circular step, and it does not make the derivation depend on its own conclusion. The unproved Proposition 4.1 in Section 4 is also independent of the main equinumerosity, which is established by Theorem 3.1 alone. The cited enumeration results, Guy–Krattenthaler–Sagan and the hook-length formula, are external and used for context rather than as assumptions in the bijection. Therefore the paper exhibits no significant circularity.
Assumptions & free parameters
assumptions (2)
- standard math Standard conventions for Young diagrams and standard Young tableaux: entries increase left to right along rows and top to bottom down columns.
- domain assumption In a standard Young tableau, the entry 1 is forced to the top-left corner and entry 2 cannot occupy the heart of theta(n).
Cite this review
Pith. "Pith review of An exceptional equinumerosity of lattice paths and Young tableaux." pith.science (2026). https://pith.science/paper/T5O2A237
@misc{pith2026250603116,
author = {Pith},
title = {Pith review of: An exceptional equinumerosity of lattice paths and Young tableaux},
year = {2026},
howpublished = {\url{https://pith.science/paper/T5O2A237}},
note = {Machine review of arXiv:2506.03116}
}
abstract
We consider families $\mathcal{P}_n$ of plane lattice paths enumerated by Guy, Krattenthaler, and Sagan (1992). We show by explicit bijection that these families are equinumerous with the set $\mathrm{SYT}(n+2,2,1^n)$ of standard Young tableaux.
Figures
Reference graph
Works this paper leans on
-
[1]
Stephen B. Connor and Christopher J. Fewster, Integrals of incomplete beta functions, with applications to order statistics, random walks and string enumeration, Braz. J. Probab. Stat. 36 (2022), no. 1, 185--198. 4377128
work page 2022
-
[2]
Chris Fraser, Rebecca Patrias, Oliver Pechenik, and Jessica Striker, Web invariants for flamingo S pecht modules , Algebr. Comb. 8 (2025), no. 1, 235--266. 4878046
work page 2025
-
[3]
J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs of the symmetric groups, Canad. J. Math. 6 (1954), 316--324. 62127
work page 1954
-
[4]
William Fulton, Young tableaux. W ith applications to representation theory and geometry , London Mathematical Society Student Texts, vol. 35, Cambridge University Press, Cambridge, 1997
work page 1997
-
[5]
Richard K. Guy, C. Krattenthaler, and Bruce E. Sagan, Lattice paths, reflections, & dimension-changing bijections, Ars Combin. 34 (1992), 3--15. 1206544
work page 1992
-
[6]
Christian Gaetz, Oliver Pechenik, Stephan Pfannerer, Jessica Striker, and Joshua P. Swanson, Rotation-invariant web bases from hourglass plabic graphs, preprint (2023), 83 pages, arXiv:2306.12501
arXiv 2023
-
[7]
Mikhail Khovanov and Greg Kuperberg, Web bases for sl (3) are not dual canonical , Pacific J. Math. 188 (1999), no. 1, 129--153. 1680395
work page 1999
-
[8]
Jesse Kim and Brendon Rhoades, Set partitions, fermions, and skein relations, Int. Math. Res. Not. IMRN (2023), no. 11, 9427--9480. 4597211
work page 2023
Show all 20 references
-
[9]
Greg Kuperberg, Spiders for rank 2 L ie algebras , Comm. Math. Phys. 180 (1996), no. 1, 109--151. 1403861
1996
-
[10]
T. M. Langley and J. B. Remmel, The plethysm s_ [s_ ] at hook and near-hook shapes , Electron. J. Combin. 11 (2004), no. 1, Research Paper 11, 26 pages. 2035305
2004
-
[11]
OEIS Foundation , Number of lattice paths of 2*n+2 steps in the first quadrant from (0,0) to (n,n), 2025, Entry A253487 https://oeis.org/A253487 in The On-Line Encyclopedia of Integer Sequences, https://oeis.org/A253487
2025
-
[12]
Oliver Pechenik, Cyclic sieving of increasing tableaux and small S chr\"oder paths , J. Combin. Theory Ser. A 125 (2014), 357--378. 3207480
2014
-
[13]
Kyle Petersen, Pavlo Pylyavskyy, and Brendon Rhoades, Promotion and cyclic sieving via webs, J
T. Kyle Petersen, Pavlo Pylyavskyy, and Brendon Rhoades, Promotion and cyclic sieving via webs, J. Algebraic Combin. 30 (2009), no. 1, 19--41. 2519848
2009
-
[14]
Rebecca Patrias, Oliver Pechenik, and Jessica Striker, A web basis of invariant polynomials from noncrossing partitions, Adv. Math. 408 (2022), Paper No. 108603, 33 pages. 4458914
2022
-
[15]
Brendon Rhoades, Cyclic sieving, promotion, and representation theory, J. Combin. Theory Ser. A 117 (2010), no. 1, 38--76. 2557880
2010
-
[16]
Algebraic Combin
, A skein action of the symmetric group on noncrossing partitions, J. Algebraic Combin. 45 (2017), no. 1, 81--127. 3591372
2017
-
[17]
Reiner, D
V. Reiner, D. Stanton, and D. White, The cyclic sieving phenomenon, J. Combin. Theory Ser. A 108 (2004), no. 1, 17--50. 2087303
2004
-
[18]
M. P. Sch\"utzenberger, Promotion des morphismes d'ensembles ordonn\'es, Discrete Math. 2 (1972), 73--94. 299539
1972
-
[19]
Stanley, Polygon dissections and standard Y oung tableaux , J
Richard P. Stanley, Polygon dissections and standard Y oung tableaux , J. Combin. Theory Ser. A 76 (1996), no. 1, 175--177. 1406001
1996
-
[20]
, Enumerative combinatorics. V ol. 2 , second ed., Cambridge Studies in Advanced Mathematics, vol. 208, Cambridge University Press, Cambridge, 2024, With an appendix by Sergey Fomin. 4621625
2024
Reviewed August 7, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.