Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.16561

Maximal transitivity of the cactus group on standard Young tableaux

Sophia Liao·Leonid Rybnikov
View original source ↗Read source document ↗Export metadata ↓

Abstract

The action of the cactus group $C_n$ on Young tableaux of a given shape $λ$ goes back to Berenstein and Kirillov and arises naturally in the study of crystal bases and quantum integrable systems. We show that this action is $2$-transitive on standard Young tableaux of the shape $λ$ if and only if $λ$ is not self-transpose and not a single hook. Moreover, we show that in these cases, the image of the cactus group in the permutation group of standard Young tableaux is either the whole permutation group or the alternating group, and prove that both cases are possible for infinitely many $λ$ (though the alternating group is more frequent). As an application, this implies that the Galois group of solutions to the Bethe ansatz in the Gaudin model attached to the Lie group $GL_d$ is, in many cases, at least the alternating group. This also extends the results of Sottile and White on the multiple transitivity of the Galois group of Schubert calculus problems in Grassmannians to many new cases.

Explore related subjects

math.COmath.AGmath.QAmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sophia Liao, Leonid Rybnikov. 2026-01-06. Maximal transitivity of the cactus group on standard Young tableaux. https://arxiv.org/abs/2506.16561

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗