arxiv: 2605.00514 · v1 · submitted 2026-05-01 · 🧮 math.CO · math.RT

Recognition: unknown

On the action of Bender-Knuth generators of cactus group on the set of short semi-standard Young tableaux

Igor Svyatnyy

Authors on Pith no claims yet

Pith reviewed 2026-05-09 19:13 UTC · model grok-4.3

classification 🧮 math.CO math.RT

keywords cactus groupBender-Knuth generatorssemi-standard Young tableauxshort tableauxBerenstein-Kirillov groupcrystal commutors

0 comments

The pith

The Bender-Knuth generators of the cactus group act on short semi-standard Young tableaux in a way that matches their action on the full set of such tableaux.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper computes the explicit action of the generators of the cactus group on the subset of short semi-standard Young tableaux. Short tableaux are those where the number of cells in the first two columns filled with numbers up to N is at most N. The computation uses a prior definition of the action via commutors in crystals and compares it directly to the known Bender-Knuth involutions on all semi-standard Young tableaux. A reader would care if this explicit form reveals how the subset behaves under group actions that are important in algebraic combinatorics and representation theory.

Core claim

The paper establishes an explicit description of how each Bender-Knuth generator transforms a short semi-standard Young tableau, showing that this action is well-defined on the subset and can be compared term-by-term with the action on the complete set of semi-standard Young tableaux.

What carries the argument

Bender-Knuth involutions as the images of cactus group generators under the homomorphism to the Berenstein-Kirillov group, applied to the combinatorial objects of short semi-standard Young tableaux.

If this is right

The action of the cactus group preserves the short semi-standard Young tableaux.
Direct comparison between the crystal commutor definition and the Bender-Knuth definition is possible on this subset.
Explicit formulas allow for concrete calculations on small tableaux without referring to the full set.
Compatibility confirms that the restriction of the larger action is consistent.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The invariance of the short subset might indicate it forms a natural subcrystal or invariant subset under the group action.
Further study could examine whether this action simplifies for specific shapes of tableaux.
Extensions to other subsets of tableaux defined by similar column constraints may be feasible.

Load-bearing premise

The subset of short semi-standard Young tableaux is invariant under the action of the Bender-Knuth generators.

What would settle it

An explicit example for small N where a short tableau is mapped by one generator to a tableau with more than N entries in the first two columns, or where the computed action differs from the one on the full set.

read the original abstract

In the article by Michael Chmutov, Max Glick and Pavel Pylyavskii \cite{Chmutov} the action of the cactus group $C_N$ on the set of semi-standard Young tableaux filled with the numbers from $1$ to $N$ was defined. Namely, they constructed the set of generators (we rightfully call them Bender-Knuth generators) of the cactus group and a group homomorphism from $C_N$ to Berenstein-Kirillov group $BK_N$ (cf. \cite{Berenstein_Kirillov}), which sends these generators to the Bender-Knuth involutions on the set of semi-standard Young tableaux. In \cite{Henriques_Kamnitzer} Andre Henriques and Joel Kamnitzer defined a natural action of cactus group $C_N$ on the tensor product of $N$ normal crystals via commutors. By applying their result I defined the action of cactus group $C_N$ on the set of short semi-standard Young tableaux filled with the numbers $1, 2, \ldots, N$ in \cite{Svyatnyy}. A semi-standard Young tableau is called \textit{short} if the number of cells in the first two columns with the numbers $\leqslant N$ is less than or equal to $N$. The set of short semi-standard Young tableaux obviously forms a subset inside the set of semi-standard Young tableaux. The purpose of this paper is to explicitly compute the action of Bender-Knuth generators of cactus group $C_N$ on the set of short semi-standard Young tableaux defined in \cite{Svyatnyy} and compare it with their action on the set of semi-standard Young tableaux defined in \cite{Chmutov}.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This note spells out explicit Bender-Knuth formulas on short SSYT and compares them to the full-set action, but treats invariance of the short subset as already settled.

read the letter

The main point is that this short paper works out concrete formulas for how the Bender-Knuth generators act on the short semi-standard Young tableaux and lines them up against the action on the full set of SSYT. The explicit description on the restricted subset and the direct comparison are the parts that were not already in the cited earlier papers by the same author or by Chmutov et al. The computation itself is presented plainly, with the generators written out case by case so that a reader can check small examples without re-deriving everything from the crystal commutor definition. That level of detail is useful if you already work in this corner of crystal bases and cactus groups. The formulas look reproducible from the description given. The soft spot is the handling of invariance. The paper states that short tableaux form an obvious subset and that the action was defined on them in prior work, but it does not include even a brief argument or example showing that the generators map short tableaux back to short ones. Shortness is defined by a bound on the first two columns, and since the generators come from the unrestricted action, a one-paragraph check that the bound is preserved would make the note self-contained. Without it, a reader must consult the earlier paper to confirm the setup is closed. This is a minor gap rather than a load-bearing flaw, but it is noticeable in a paper whose main job is the explicit computation. The work is aimed at specialists who already know the cactus group literature and the Berenstein-Kirillov group. A reader outside that group will find the notation heavy and the motivation thin. It is not a broad theorem, but the calculation is honest and the comparison adds something concrete. I would send it to peer review. The explicit formulas are refereeable, the comparison is new enough to be worth recording, and the invariance point is small enough that a referee can ask for a short addition without derailing the paper.

Referee Report

2 major / 2 minor

Summary. The manuscript claims to explicitly compute the action of the Bender-Knuth generators of the cactus group C_N on the set of short semi-standard Young tableaux (SSYT with at most N cells in the first two columns), as previously defined by the author via the Henriques-Kamnitzer crystal commutors and the homomorphism to the Berenstein-Kirillov group, and to compare this restricted action with the action on all SSYT defined in Chmutov, Glick, and Pylyavskii.

Significance. If the explicit computations are correct and the short SSYT subset is invariant, the result supplies concrete descriptions of the restricted cactus group action on this combinatorial set, which could support further analysis of crystal tensor products or connections between the cactus group and Young tableau combinatorics.

major comments (2)

Abstract: the statement that short SSYT form an 'obvious subset' on which the action is defined supplies no argument, reference, or case check that the Bender-Knuth generators preserve the column-length bound (total cells in first two columns ≤ N). This invariance is load-bearing for the explicit computation to be well-defined on the subset and for the comparison to [Chmutov] to apply directly.
Main computation section: the central claim of explicit computation on the subset relies on the prior definition in [Svyatnyy], but without a self-contained verification (e.g., by checking how each generator affects column sums on short tableaux), the result risks being only a formal restriction rather than a verified action on the subset.

minor comments (2)

Consider adding a brief example (for small N) showing a short SSYT, its image under one or two generators, and confirmation that the image remains short, to illustrate the computation.
The references to [Svyatnyy] and [Chmutov] should include full bibliographic details or arXiv identifiers for completeness.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful review and constructive suggestions. We agree that additional justification for invariance and self-contained verification would strengthen the manuscript, and we will revise accordingly.

read point-by-point responses

Referee: Abstract: the statement that short SSYT form an 'obvious subset' on which the action is defined supplies no argument, reference, or case check that the Bender-Knuth generators preserve the column-length bound (total cells in first two columns ≤ N). This invariance is load-bearing for the explicit computation to be well-defined on the subset and for the comparison to [Chmutov] to apply directly.

Authors: We agree that the word 'obviously' is insufficient and provides no explicit justification. In the revised manuscript we will replace this phrasing with a brief reference to the definition of the action via Henriques-Kamnitzer commutors in [Svyatnyy] together with a short argument (or representative case check) confirming that each Bender-Knuth generator preserves the bound on the total number of cells in the first two columns. This will make the invariance explicit and allow the comparison with the unrestricted action in [Chmutov] to apply directly. revision: yes
Referee: Main computation section: the central claim of explicit computation on the subset relies on the prior definition in [Svyatnyy], but without a self-contained verification (e.g., by checking how each generator affects column sums on short tableaux), the result risks being only a formal restriction rather than a verified action on the subset.

Authors: The explicit formulas are obtained by restricting the action already constructed in [Svyatnyy]. To address the request for self-containment we will add a short subsection that verifies, for each Bender-Knuth generator, that the column-length bound is preserved on short tableaux (for instance by examining the effect on the relevant column sums or by direct computation on the possible local configurations). This will confirm that the computed action is indeed an action on the subset rather than a purely formal restriction. revision: yes

Circularity Check

1 steps flagged

Action on short SSYT defined via self-citation; invariance not re-verified in this paper

specific steps

self citation load bearing [Abstract]
"By applying their result I defined the action of cactus group $C_N$ on the set of short semi-standard Young tableaux filled with the numbers $1, 2, …, N$ in [Svyatnyy]."

The paper's purpose is to compute this action explicitly, yet its existence and invariance on the short subset (shortness: cells in first two columns ≤ N) are taken as given from the same author's earlier paper without re-derivation or verification in the present manuscript.

full rationale

The paper's central object—the explicit action of Bender-Knuth generators on short semi-standard Young tableaux—is introduced by direct reference to the author's prior definition in [Svyatnyy], which itself relies on applying Henriques-Kamnitzer commutors and the cactus-to-BK homomorphism. While the subsequent case-by-case computation and comparison to the Chmutov action on all SSYT introduce independent content, the load-bearing claim that the short subset is invariant (required for the action to be well-defined on it) receives no independent argument or check here. This is a moderate self-citation dependence rather than a full reduction by construction, with no self-definitional loops, fitted predictions, or ansatz smuggling detected.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the prior definition of the cactus group action via Bender-Knuth involutions and the claim that short tableaux form a suitable subset.

axioms (2)

domain assumption The cactus group C_N acts on semi-standard Young tableaux via the homomorphism to the Berenstein-Kirillov group sending generators to Bender-Knuth involutions, as defined in Chmutov et al.
Invoked to justify the generators whose action is being computed.
domain assumption The set of short semi-standard Young tableaux is closed under the cactus group action.
Required for the restricted action to be well-defined on the subset.

pith-pipeline@v0.9.0 · 5626 in / 1366 out tokens · 30448 ms · 2026-05-09T19:13:11.395230+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

15 extracted references · 5 canonical work pages

[1]

Crystals and coboundary categories

Henriques, Andre; Kamnitzer, Joel. Crystals and coboundary categories. Duke Math. J. 132 (2006), no. 2, 191–216

2006
[2]

A definition of the crystal commutor using Kashiwara's involution

Kamnitzer, Joel; Tingley, Peter. A definition of the crystal commutor using Kashiwara's involution. arXiv: 0610952v2[math.QA] link https://arxiv.org/abs/math/0610952

work page arXiv
[3]

arXiv:2504.14344 [math.RT] link https://arxiv.org/abs/2504.14344

Igor Svyatnyy, On the action of the cactus group on the set of Gelfand-Tsetlin patterns for orthogonal Lie algebras. arXiv:2504.14344 [math.RT] link https://arxiv.org/abs/2504.14344

work page arXiv
[4]

arXiv:1609.02046 [math.CO] link https://arxiv.org/abs/1609.02046

Michael Chmutov, Max Glick, Pavlo Pylyavskii, The Berenstein-Kirillov group and cactus groups. arXiv:1609.02046 [math.CO] link https://arxiv.org/abs/1609.02046

work page arXiv
[5]

A. N. Kirillov and A. D. Berenstein. Groups generated by involutions, Gelfand-Tsetlin pat terns, and combinatorics of Young tableaux. Algebra i Analiz, 7(1):92–152, (1995)

1995
[6]

Kirillov,\,Introduction to Lie Groups and Lie Algebras, 1mm http://www.math.sunysb.edu/ kirillov/liegroups/ link

A. Kirillov,\,Introduction to Lie Groups and Lie Algebras, 1mm http://www.math.sunysb.edu/ kirillov/liegroups/ link
[7]

M.Kashiwara, Crystallizing the q-analogue of universal eveloping algebras. Comm. Math. Phys. 11 (1990), 249-260

1990
[8]

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

M. Kashiwara, On crystal bases of the q-analogue of universal enveloping algebras. Duke Math. J. 63 (1991), no. 2, 465–516

1991
[9]

Kashiwara, Crystal base and Littelmann's refined Demazure character formula

M. Kashiwara, Crystal base and Littelmann's refined Demazure character formula. Duke Math. J. 71 (1993), 839-858

1993
[10]

Kashiwara, On crystal bases

M. Kashiwara, On crystal bases. Representations of Groups, Proceedings of the 1994 Annual Seminar of the Canadian Math. Soc. Banff Center, Banff, Alberta, June 15--24, (B.N. Allison and G.H. Cliff, eds), CMS Conference proceedings, 16 (1995) 155--197, Amer. Math. Soc., Providence, RI

1994
[11]

Kashiwara, T

M. Kashiwara, T. Nakashima. Crystal graphs for Representations of the q-Analogue of Classical Lie Algebras. Journal of Algebra, 165 (1994) 295--345

1994
[12]

Joseph, Quantum Groups and Their Primitive Ideals, Springer-Verlag, 1995

A. Joseph, Quantum Groups and Their Primitive Ideals, Springer-Verlag, 1995

1995
[13]

Lusztig, On quantum groups

G. Lusztig, On quantum groups. J. Algebra 131 (1990), 466-475

1990
[14]

Transactions of the American Mathematical Society, vol

Howe, Roger, Remarks on Classical Invariant Theory. Transactions of the American Mathematical Society, vol. 313, no. 2, 1989, pp. 539–70. JSTOR, https://doi.org/10.2307/2001418. Accessed 27 May 2023

work page doi:10.2307/2001418 1989
[15]

Fulton and J

William Fulton, Joe Harris. Representation Theory: A First Course. Published by Springer New York ISBN: 978-3-540-00539-1 DOI: 10.1007/978-1-4612-0979-9

work page doi:10.1007/978-1-4612-0979-9