Search arXivSearch

arXiv · 2605.00514

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

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}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Igor Svyatnyy. 2026-05-01. On the action of Bender-Knuth generators of cactus group on the set of short semi-standard Young tableaux. https://arxiv.org/abs/2605.00514

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO