The recording tableaux in the quantum Littlewood-Richardson map, the orthogonal transpose symmetry map, and the computation of mathfrak{k}-highest weight tableaux
Pith reviewed 2026-05-15 09:58 UTC · model grok-4.3
The pith
A combinatorial identification proves the surjectivity of the quantum Littlewood-Richardson map on recording tableaux.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The recording tableaux produced by Watanabe's algorithm coincide with Littlewood-Richardson-Sundaram tableaux. This equality supplies the missing combinatorial half of the bijection, proves surjectivity of the quantum LR map without representation theory, exhibits the restriction of the LR orthogonal transpose symmetry map to LR-Sundaram tableaux, and furnishes an explicit branching model for the multiplicities from GL_{2n}(C) to Sp_{2n}(C) that also computes the relevant highest weight tableaux via the crystal basis of the associated iquantum group.
What carries the argument
Watanabe's algorithm that produces, from each semi-standard Young tableau of shape with at most 2n parts, a pair consisting of a symplectic tableau of shape with at most n parts and a recording tableau of the complementary skew shape.
If this is right
- The quantum LR map becomes a fully combinatorial branching rule for the restriction multiplicities from GL_{2n} to Sp_{2n}.
- The orthogonal transpose symmetry map restricts explicitly to the set of LR-Sundaram tableaux.
- Highest weight tableaux arising in the Naito-Sagaki conjecture can be computed directly from the branching rule based on the crystal basis of the iquantum group of type AII_{2n-1}.
Where Pith is reading between the lines
- The same recording-tableau identification may extend to other quantum symmetric pairs where only representation-theoretic surjectivity is currently known.
- Explicit highest weight tableaux obtained this way could be used to test conjectural formulas for branching multiplicities in small rank cases.
- The construction tightens the link between quantum LR rules and classical combinatorial rules for symplectic and orthogonal tableaux.
Load-bearing premise
The recording tableaux generated by the algorithm are combinatorially identical to Littlewood-Richardson-Sundaram tableaux rather than merely equinumerous with them.
What would settle it
A single semi-standard Young tableau whose recording tableau under the algorithm fails to be a Littlewood-Richardson-Sundaram tableau, or a Littlewood-Richardson-Sundaram tableau that cannot arise as a recording tableau, would disprove the claimed identification.
read the original abstract
Recently Watanabe has given an algorithm to compute a bijection, that he calls (quantum) Littlewood-Richardson (LR) map (or quantum LR rule of type AII), between semi-standard Young tableaux of shape a partition with at most $2n$ parts and pairs of tableaux consisting of a symplectic tableau with shape a partition with at most $n$ parts, and a recording tableau of skew-shape given by the two previous shapes. The recording tableaux in that algorithm are shown to be equinumerous to Littlewood-Richardson-Sundaram tableaux whose injectivity is shown combinatorially while the surjectivity is concluded via representation theory of a quantum symmetric pair of type AII$_{2n-1}$. Henceforth, the algorithm to compute the quantum LR map provides a new branching model for the branching multiplicities from $GL_{2n}(\C)$ to $Sp_{2n}(\C)$. Here, as morally suggested by Watanabe, one provides a combinatorial proof for the surjectivity of the quantum LR map which in turn exhibits the restriction of the LR orthogonal transpose symmetry map to LR-Sundaram tableaux. The surjectivity is exhibited via the reverse Schensted insertion on the quantum recording tableaux, ruled by the slack data, followed with the inverse of the reduction map on the bumped entries that we explicitly compute. As an application of the inverse of the quantum LR map, we compute and characterize by certain linear inequalities a family of $\mathfrak{k}$- highest weight semi-standard tableaux in the recent proof of the Naito-Sagaki conjecture using the Watanabe'sbranching rule based on the crystal basis theory for $\imath$quantumgroups of type AII$_{2n-1}$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript presents a combinatorial proof for the surjectivity of Watanabe's quantum Littlewood-Richardson map. It establishes that the recording tableaux produced by the algorithm are precisely the Littlewood-Richardson-Sundaram tableaux via restriction of the LR orthogonal transpose symmetry map, replacing the original representation-theoretic argument. This yields a combinatorial branching model for multiplicities from GL_{2n}(C) to Sp_{2n}(C) and is applied to compute highest weight tableaux in the Naito-Sagaki conjecture setting using crystal bases for iquantum groups of type AII_{2n-1}.
Significance. If the explicit combinatorial identification holds, the result supplies an independent, representation-theory-free proof of surjectivity and a direct combinatorial description of the image of the quantum LR map. This strengthens the branching model and enables explicit computation of highest weight tableaux, which is a concrete advance for applications in crystal basis theory and quantum symmetric pairs of type AII.
minor comments (2)
- Abstract: the phrase 'morally suggested by Watanabe' should be replaced by a precise citation to the relevant statement or construction in Watanabe's original paper.
- Application section: an explicit small-rank example (e.g., n=2 or n=3) illustrating the computation of a highest weight tableau via the new surjectivity map would improve readability and verifiability.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript, including the summary of the combinatorial proof of surjectivity for the quantum LR map and the explicit restriction of the orthogonal transpose symmetry map. We appreciate the recommendation for minor revision.
Circularity Check
No significant circularity; combinatorial surjectivity proof is self-contained
full rationale
The manuscript supplies an explicit combinatorial construction that identifies the image of Watanabe's quantum LR map with the LR-Sundaram tableaux by restricting the orthogonal transpose symmetry map. This directly establishes surjectivity without invoking the representation-theoretic argument it replaces. No step reduces by definition to a fitted input, self-citation chain, or imported uniqueness theorem; the derivation relies on direct bijections and restrictions that remain independent of the quantum-group surjectivity result. The central claim therefore rests on combinatorial content rather than circular reduction.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Standard combinatorial properties of semi-standard Young tableaux and their recording tableaux under the quantum LR map
- domain assumption Equinumerosity between recording tableaux and Littlewood-Richardson-Sundaram tableaux
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AbsoluteFloorClosure.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem A … ♢ is a bijection between LRS 2n(λ/µ) and eRec 2n(λ/µ)
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
reverse column insertion … red(a) … suc(S)
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Forward citations
Cited by 1 Pith paper
-
The slack data of the recording tableaux in the quantum Littlewood-Richardson map determines its inverse: some applications
The slack data of recording tableaux determines the inverse of the quantum Littlewood-Richardson map and applies to k-highest symplectic tableaux.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.