Pith. sign in

REVIEW 2 major objections 3 minor 30 references

Flagged Littlewood-Richardson tableaux and branching rule for classical groups

T0 review · 2 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read A new subtraction-free branching rule from GL_n to O_n, expressed by flagged Littlewood–Richardson tableaux, is proved and applied to Lusztig t-weight multiplicities.

desk verdict A genuinely new and likely correct subtraction-free branching formula for GL_n to O_n, but the proof as written has an omitted load-bearing case in Lemma 6.8 that needs to be supplied. read the letter →

arxiv 1908.11041 v2 pith:I4XOYTYK submitted 2019-08-29 math.RT math.COmath.QA

Il-Seung Jang , Jae-Hoon Kwon This is my paper · ORCID
classification math.RTmath.COmath.QA MSC 17B3722E4605E10
keywords branchingruleLittlewood-RichardsontableauxflagconditionspinormodelorthogonalgroupgeneralizedexponentsLusztigt-weightmultiplicitycrystalgraphs
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 proves a new combinatorial formula for the branching multiplicity of an irreducible orthogonal group representation in a general linear group representation. The formula expresses the multiplicity as a sum over even partitions of the number of Littlewood–Richardson tableaux satisfying a simple flag condition on their second-rightmost column. It is subtraction-free, valid for arbitrary λ with length at most n, and reduces exactly to Littlewood's restriction formula in the stable range ℓ(λ) ≤ n/2. As a byproduct, the authors obtain a new combinatorial realization of Lusztig's t-weight multiplicity at zero weight for types B_n and D_n.

What carries the argument

The machinery has three parts. First, the spinor model T(μ,n) is a crystal of admissible sequences of tableaux T_i of shapes λ(a_i,b_i,c_i) that realizes the type-D crystal B(Λ(μ)); it is the setting in which branching multiplicities become counts of l-highest weight elements. Second, the separation algorithm uses sliding operators S_j, each a specific composition of jeu de taquin moves, to move a column tail one position leftward; iterating it decomposes any l-highest weight element as a pair (H_{($δ^{1}$)^π}, U) with U a flagged Littlewood–Richardson tableau. Third, the bijection ψ, an anti-lattice analogue of a known bijection between conjugate-shape LR tableaux and their anti-content counterparts, identifies the conjugate-shape tableaux $LR^{{λ'}}$_{δ' μ'} with the anti-content tableaux LR^λ_{δμπ} and converts the flag condition τ_j + n_j ≤ n+1 into an equivalent condition on the first-row entries of the original tableau.

What would settle it

Take a specific pair outside the stable range, for instance n=8, λ=(5,4,4,3,2,2,0,0), μ=(2,2,2,1,1) from Example 4.18, compute the left side of Theorem 4.17 by an independent algebraic method (e.g., the formula in [2, Theorem 4]) and compare with the sum Σ c^λ_{δμ}; the two agree in the example, and a single disagreement for any pair would falsify the identity.

Watch

Extended reading notes

Core claim

The central result (Theorem 1.1, stated as Theorem 4.17) is the identity [V^λ_{GL_n}:V^μ_{O_n}] = Σ_{δ∈P(2)_n} c^λ_{δμ}, where c^λ_{δμ} counts Littlewood–Richardson tableaux U of shape λ/δ with content μ^π satisfying τ_j + n_j ≤ n+1 for 1 ≤ j ≤ μ'_2, with τ_j the entries of the second rightmost column of the companion tableau and n_j defined via a 'missing indices' sequence. The proof identifies the branching multiplicity with the number of l-highest weight elements in the type-D spinor model T(μ,n) (via Howe duality), then constructs a bijection from these elements to the flagged tableaux using a new combinatorial operation called separation. Separation is carried out by sliding operators that move column tails leftward while preserving type-A crystal equivalence, and a second bijection ψ translates the flag condition into the companion-tableau form. The formula vanishes, i.e., reduces to the classical Littlewood sum, exactly when ℓ(λ) ≤ n/2.

Load-bearing premise

The proof relies on the equality between the branching multiplicity [V^λ_{GL_n}:V^μ_{O_n}] and the number of l-highest weight elements in the spinor model T(μ,n); if this identity (grounded in Howe duality and the crystal isomorphism of Theorem 2.7) failed, the flagged tableau count would not measure the true multiplicity.

Editorial extensions

If this is right

  • The formula gives a subtraction-free count of [V^λ_{GL_n}:V^μ_{O_n}] for every λ with ℓ(λ) ≤ n, beyond the stable range where Littlewood's product formula applies.
  • In the stable range ℓ(λ) ≤ n/2 the flagged set LR^λ_{δμπ} coincides with the full set LR^λ_{δμπ}, so the new sum is literally Littlewood's formula (Corollary 4.13).
  • For type B_n and D_n, the generalized exponents — equivalently the Lusztig t-weight multiplicities K_{μ0}(t) — are expressed as sums over distinguished tableaux D_n(μ) with weights measured by |φ+ρ|/2 (Theorem 5.6).
  • The same separation machinery is shown to yield analogous flagged-LR formulas for the GL_n-to-Sp_n and type-B/C branching rules (Remark 4.16).

Reading between the lines

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

  • The flag condition τ_j + n_j ≤ n+1 is likely a tableau version of 'the column fits inside n boxes'; tracing it through the bijection ψ might connect it to the orthogonal tableaux models of Sundaram and King, though the paper leaves such a bijection open (Remark 5.8).
  • The separation algorithm, defined here only on highest-weight elements, has a natural extension to arbitrary crystal elements; a broader version is mentioned in the paper's Remark 3.22(1), and if carried out it could yield branching formulas for tensor products or for other reductive pairs.
  • The new formula is manifestly positive, so it gives an independent combinatorial proof of the positivity of these branching multiplicities; comparing it with the known alternating formula of [2] for special μ,ν may suggest new bijections between flagged LR tableaux and the terms in that alternating sum.
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

2 major / 3 minor

Summary. The paper develops a combinatorial branching formula from GL_n to O_n, expressing the multiplicity [V^λ_{GL_n}:V^μ_{O_n}] as a sum over even partitions δ of the number c^λ_{δμ} of Littlewood–Richardson tableaux of shape λ/δ with content μ^π satisfying the flag condition τ_j + n_j ≤ n+1 (Theorem 1.1 / Theorem 4.17). The proof proceeds through a spinor model of type D, a separation algorithm on highest-weight elements, and a bijection (Theorem 4.4) between l-highest weight elements and flagged LR tableaux. The paper also derives a combinatorial formula for Lusztig t-weight multiplicities for types B_n and D_n (Theorem 5.6) and shows that the branching formula reduces to Littlewood's stable restriction rule when ℓ(λ) ≤ n/2 (Corollary 4.13).

Significance. If correct, the main theorem provides a subtraction-free, manifestly positive formula for an orthogonal branching rule outside the stable range, resolving an open analogue of known symplectic results. The formula is not forced by normalization or by assuming the desired count: the flag condition (4.3) is derived from the separation algorithm, and the independent checks in Example 4.18 and the stable-range recovery in Corollary 4.13 give meaningful evidence. The application to generalized exponents is a natural and potentially useful byproduct. However, the paper's central claim rests on the surjectivity half of Theorem 4.4, whose proof is not complete as written.

major comments (2)
  1. [§6.2, Lemma 6.8] The surjectivity proof of the main bijection Theorem 4.4 is incomplete: Lemma 6.8 splits the verification of Ti+1 < Ti into four residue cases, but Case 3 is disposed of with the sentence 'The proof of this case is almost identical with Case 2. We leave it to the reader.' This is load-bearing, not cosmetic. In Case 3 the inequalities are mixed (rU_{2i+1}(a_i) < rU_{2i}(1) and rU_{2i+3}(a_{i+1}) > rU_{2i+2}(1)), while the displayed ˚-pairs and inequalities in Case 2, notably (6.17)–(6.21), are derived under the opposite first inequality. An explicit verification of Definition 2.4(1)(i)–(iii) in the mixed pattern is therefore required before Lemma 6.8, and with it the surjectivity of Theorem 4.4 and the branching formula Theorem 4.17, can be regarded as proved.
  2. [§6.3, Lemma 6.9] Lemma 6.9, which handles the case n − 2μ'_1 < 0, asserts the key bound m_i ≤ L and the equality A_tail = T_tail with only a 'by construction' justification. These claims are not immediate from the displayed construction of B and A, and Lemma 6.9 also calls on Lemma 6.8, so it inherits the gap in Case 3. Since this lemma establishes well-definedness of the map in the negative branch, the proof of Theorem 4.4 for n − 2μ'_1 < 0 also needs additional detail.
minor comments (3)
  1. [Abstract and §5.1] The name of the t-weight multiplicity is spelled 'Lustig' in the abstract and in Section 5.1; it should be 'Lusztig' to match the rest of the paper and the literature.
  2. [§2.2, display (2.2)] The arrow in the displayed bijection ψ : LR^{λ'}_{μ'ν'} → LR^λ_{μν^π} appears garbled as '/d47/d47'; this is likely a rendering issue, and the authors should ensure the published version displays a single bijective arrow.
  3. [§4.2, Example 4.18] In the sentence 'Then it is straightforward to check that for ξ,υ ∈ P(2)_8', the line break between 'c^{λ'}_{ξ'μ'} =' and the case values makes the two cases visually awkward; a displayed aligned equation would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the flagged Littlewood–Richardson count is an independent combinatorial problem; cited spinor-model and Howe-duality identifications are prior external support, not re-importations of the target formula.

full rationale

The central claim (Theorem 4.17) equates the representation-theoretic branching multiplicity with a sum of numbers of flagged LR tableaux. The flag condition (4.2)/(4.3) is derived from the separation algorithm and is shown necessary and sufficient in Lemmas 6.3 and 6.8; it is not imposed to match the desired multiplicity. The only external inputs are the spinor model T(μ,n) (Theorem 2.7, from [19]) and the identity [V^λ_GLn : V^μ_On] = c^μ_λ(d) (from [21, Theorem 5.3]); both are published, parameter-free results whose statements do not include the flagged-tableau formula, so they provide real independent support rather than circular premises. The proof of Theorem 4.4 is a direct bijection; subsection 6.3 applies the already-established case n-2μ'_1 ≥ 0 rather than assuming the theorem being proved. The manuscript does contain an explicitly omitted subcase in the surjectivity proof, Lemma 6.8 Case 3: 'The proof of this case is almost identical with Case 2. We leave it to the reader,' and Lemma 6.9 asserts a key bound and equality 'by construction.' These are proof-completeness or correctness concerns, not circularity: no step of the derivation is defined in terms of the conclusion, and no fitted parameter is renamed as a prediction.

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

The central formula rests on the spinor-model crystal realization and on the Howe-duality identification of the branching multiplicity; these are cited from prior work by the authors and others. No new physical or algebraic entities are introduced, and there are no fitted numerical parameters. The flagged condition (4.3) is derived from the separation algorithm rather than postulated.

assumptions (6)
  • standard math Crystal tensor product rule and standard crystal axioms for type D infinity.
    Used throughout Section 2.1 and in the tensor product rule (2.1) for defining the l-crystal structure and the operator S_j.
  • domain assumption The spinor model T(μ,n) is a connected crystal with highest weight Λ(μ).
    Theorem 2.7, quoted from [19, Theorem 4.3-4.4]. Without this, counting l-highest weight elements in T(μ,n) would not correspond to representation multiplicities.
  • domain assumption The branching multiplicity [V^λ_{GL_n}:V^μ_{O_n}] equals the number c^μ_λ(d) of l-highest weight elements in T(μ,n) with highest weight λ'.
    Invoked in the proof of Theorem 4.17 via [21, Theorem 5.3] and 'see-saw pairs' in Howe duality. This connects the crystal model to the representation-theoretic multiplicity.
  • standard math The bijection ψ: LR^{λ'}_{μ'ν'} → LR^λ_{μν^π} in (2.2), an analogue of the Hanlon-Sundaram bijection.
    The paper defines and proves the bijection in Section 2.2 following [4] and references therein; it is used to identify the two flagged tableau sets in Lemma 4.8 and Theorem 4.9.
  • standard math The Littlewood identity (5.3) expressing the graded character of the symmetric algebra in terms of GL_n characters.
    Used in Section 5 to pass from branching multiplicities to Lusztig t-weight multiplicities.
  • standard math Kostant's theorem that the symmetric algebra is free over its invariants with harmonic generators, and the relation K^g_{μ0}(t) = E_t(V^μ_g).
    Background for the generalized exponents application in Section 5.1, cited from [17] and [5].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Flagged Littlewood-Richardson tableaux and branching rule for classical groups." pith.science (2026). https://pith.science/paper/I4XOYTYK

@misc{pith2026190811041,
  author       = {Pith},
  title        = {Pith review of: Flagged Littlewood-Richardson tableaux and branching rule for classical groups},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/I4XOYTYK}},
  note         = {Machine review of arXiv:1908.11041}
}
abstract

We give a new formula for the branching rule from ${\rm GL}_n$ to ${\rm O}_n$ generalizing the Littlewood's restriction formula. The formula is given in terms of Littlewood-Richardson tableaux with certain flag conditions which vanish in a stable range. As an application, we give a combinatorial formula for the Lusztig $t$-weight multiplicity $K_{\mu 0}(t)$ of type $B_n$ and $D_n$ with highest weight $\mu$ and weight $0$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 27 canonical work pages

  1. [1]

    Berele, A Schensted-Type Correspondence for the Symplectic Group , J

    A. Berele, A Schensted-Type Correspondence for the Symplectic Group , J. Combin. Theory, Ser. A 43 (1986) 320–328. DOI:10.1016/0097-3165(86)90070-1

    work page doi:10.1016/0097-3165(86)90070-1 1986

  2. [2]

    Enright, J

    T. Enright, J. Willenbring, Hilbert series, Howe duality and branching for classical gr oups, Ann. of Math. (2) 159 (2004) 337–375. DOI:10.4007/annals.2004.159.337

    work page doi:10.4007/annals.2004.159.337 2004

  3. [3]

    Fulton, Young tableaux : with application to representation theory and geometry , Cam- bridge Univ

    W. Fulton, Young tableaux : with application to representation theory and geometry , Cam- bridge Univ. Press, 1997. DOI:10.1017/CBO9780511626241

    doi:10.1017/cbo9780511626241 1997

  4. [4]

    Hanlon, S

    P. Hanlon, S. Sundaram, On a bijection between Littlewood-Richardson fillings of co njugate shape, J. Combin. Theory Ser. A 60 (1992) 1–18. DOI:10.1016/0097-3165(92)90034-R

    work page doi:10.1016/0097-3165(92)90034-r 1992

  5. [5]

    Hesselink, Characters of the nullcone , Math

    W-H. Hesselink, Characters of the nullcone , Math. Ann. 252 (1980) 179–182. DOI:10.1007/BF01420081

    work page doi:10.1007/bf01420081 1980

  6. [6]

    Howe, E.-C

    R. Howe, E.-C. Tan, J. Willenbring, Stable branching rules for classical symmetric pairs , Trans. Amer. Math. Soc. 357 (2005) 1601–1626. DOI:10.1090/S0002-9947-04-03722-5

    work page doi:10.1090/s0002-9947-04-03722-5 2005

  7. [7]

    Hong, S.-J

    J. Hong, S.-J. Kang, Introduction to quantum groups and crystal bases , Graduate Studies in Mathematics 42. Amer. Math. Soc., 2002

    work page 2002

  8. [8]

    A Sundaram type bijection for $\mathrm{SO}(2k+1)$: vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau

    J. Jagenteufel, A Sundaram type bijection for SOp2k ` 1q, preprint (2019), arXiv:1902.03843

    work page Pith review arXiv 2019

Show all 30 references
  1. [9]

    I.-S, Jang, J.-H, Kwon, Lusztig Data of Kashiwara-Nakashima Tableaux in Type D , Algebr Represent Theor (2020) DOI:10.1007/s10468-020-09975-9

    2020 doi

  2. [10]

    Kashiwara, On crystal bases of the q-analogue of universal enveloping algebras , Duke Math

    M. Kashiwara, On crystal bases of the q-analogue of universal enveloping algebras , Duke Math. J. 63 (1991) 465–516. DOI:10.1215/S0012-7094-91-06321-0

    1991 doi

  3. [11]

    Kashiwara, On crystal bases , Representations of groups, 155–197, CMS Conf

    M. Kashiwara, On crystal bases , Representations of groups, 155–197, CMS Conf. Proc., 16, Amer. Math. Soc., Providence, RI, 1995

    1995

  4. [12]

    Kashiwara, T

    M. Kashiwara, T. Nakashima, Crystal graphs for representations of the q-analogue of classical Lie algebras, J. Algebra 165 (1994) 295–345. DOI:10.1006/jabr.1994.1114

    1994

  5. [13]

    R. C. King, Weight multiplicities for the classical groups , in Lecture Notes in Physics. Vol. 50, pp. 490–499, Springer-Verlag, New York, 1975. DOI:10.1 007/3-540-07789-8 51

    1975

  6. [14]

    King, N.G

    R.C. King, N.G. El-Sharkaway, Standard Young tableaux and weight multiplici- ties of the classical Lie groups , J. Phys. A: Math. Gen. 16 (1983) 3153–3177. DOI:10.1088/0305-4470/16/14/012

    1983 doi

  7. [15]

    R. C. King, T. A. Welsh, Construction of orthogonal group modules using tableaux , Linear and Multilinear Algebra, 33:3-4, (1991) 251–283. DOI: 10.1080/03081089308818198

    1991 doi

  8. [16]

    Koike, I

    K. Koike, I. Terada, Young diagrammatic methods for the restriction of represen tations of complex classical Lie groups to reductive subgroups of maxi mal rank, Adv. in Math. 79 (1990) 104–135. DOI:10.1016/0001-8708(90)90059-V

    1990 doi

  9. [17]

    Kostant, Lie group representations on polynomial rings , Amer

    B. Kostant, Lie group representations on polynomial rings , Amer. J. Math. 85 (1963) 327–404. URL:projecteuclid.org/euclid.bams/1183525365

    1963

  10. [18]

    J.-H, Kwon, Super duality and crystal bases for quantum ortho-symplect ic superalgebras, Int. Math. Res. Not. (2015) 12620–12677. DOI:10.1093/imrn/rnv 076

    2015 doi

  11. [19]

    J.-H, Kwon, Super duality and crystal bases for quantum ortho-symplect ic superalgebras II , J. Algebr. Comb. 43 (2016) 553-588. DOI:10.1007/s10801-015-0646-6

    2016 doi

  12. [20]

    Algebra 503 (2018) 222–264

    J.-H, Kwon, Lusztig data of KashiwaraNakashima tableaux in types B and C , J. Algebra 503 (2018) 222–264. DOI:10.1016/j.jalgebra.2018.02.001

    2018 doi

  13. [21]

    J.-H, Kwon, Combinatorial extension of stable branching rules for clas sical groups , Trans. Amer. Math. Soc. 370 (2018) 6125–6152. DOI:10.1090/tran/7104. 50 IL-SEUNG JANG AND JAE-HOON KWON

    2018 doi

  14. [22]

    Lecouvey, C

    C. Lecouvey, C. Lenart, Combinatorics of generalized exponents , Int. Math. Res. Not. (2018). DOI:10.1093/imrn/rny157

    2018 doi

  15. [23]

    Littlewood, On invariant theory under restricted groups , Philos

    D. Littlewood, On invariant theory under restricted groups , Philos. Trans. Roy. Soc. London. Ser. A. 239 (1944) 387–417. DOI:10.1098/rsta.1944.0003

    1944

  16. [24]

    Littlewood, The theory of group characters and matrix representations o f groups, Clarendon Press, Oxford, 1950

    D. Littlewood, The theory of group characters and matrix representations o f groups, Clarendon Press, Oxford, 1950

    1950

  17. [25]

    Okada, A Robinson–Schensted-type algorithm for SOp2n, Cq, J

    S. Okada, A Robinson–Schensted-type algorithm for SOp2n, Cq, J. Algebra 143 (1991) 334–

    1991

  18. [26]

    R. A. Proctor, A Schensted algorithm which models tensor representations of the orthogonal group, Canad. J. Math 42 (1990) 28–49. DOI:10.4153/CJM-1990-002-1P

    1990 doi

  19. [27]

    Sundaram, On the combinatorics of representations of the symplectic g roup, Thesis (Ph.D.)- Massachusetts Institute of Technology

    S. Sundaram, On the combinatorics of representations of the symplectic g roup, Thesis (Ph.D.)- Massachusetts Institute of Technology. (1986). URL:hdl.h andle.net/1721.1/15060

    1986

  20. [28]

    Sundaram, Orthogonal tableaux and an insertion scheme for SOp2n` 1q, J

    S. Sundaram, Orthogonal tableaux and an insertion scheme for SOp2n` 1q, J. Combin. Theory Ser. A 53 (1990) 239–256. DOI:10.1016/0097-3165(90)90059-6

    1990 doi

  21. [29]

    Wang, Duality in infinite dimensional Fock representations , Commun

    W. Wang, Duality in infinite dimensional Fock representations , Commun. Contemp. Math. 1 (1999) 155–199. DOI:10.1142/S0219199799000080. Department of Mathematical Sciences, Seoul National Unive rsity, Seoul 08826, Korea E-mail address : is jang@snu.ac.kr Department of Mathemati...

    1999 doi

  22. [372]

    DOI:10.1016/0021-8693(91)90269-E

    doi

Pith tools

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