Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.01947

A uniform action of the dihedral group $ Z_2\times D_3$ on Littlewood--Richardson coefficients

Olga Azenhas·Alessandro Conflitti·Ricardo Mamede
View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that the dihedral group $ Z_2\times D_3$ of order twelve acts faithfully on the set LR, either consisting of Littlewood-Richardson tableaux, or their companion tableaux, or Knutson-Tao hives or Knutson-Tao-Woodward puzzles,via involutions which simultaneously conjugate or shuffle a Littlewood-Richardson triple of partitions. The action of $ Z_2\times D_3$ carries a linear time index two subgroup $H\simeq D_3$ action, where an involution which goes from $H$ into the other coset of H is difficult in the sense that it is not manifest neither exhibited by simple means. Pak and Vallejo have earlier made this observation with respect to the subgroup of index two in the symmetric group $ S_3$ consisting of cyclic permutations which H extends. The other half LR symmetries, not in the range of the H-action, are hidden and consist of commutativity and conjugation symmetries. Their exhibition is reduced to the action of a remaining generator of $ Z_2\times D_3$, which belongs to the other coset of H, and enables to reduce in linear time all known LR commuters and transposers to each other, and to the Luzstig- Schützenberger involution. A hive is specified by superimposing the companion tableau pair of an LR tableau, and its $Z_2\times D_3$-symmetries are exhibited via the corresponding LR companion tableau pair. The action of $ Z_2\times D_3$ on puzzles, naturally in bijection with Purbhoo mosaics, is consistent with the migration map on mosaics which translates to jeu de taquin slides or tableau-switching on LR tableaux. Their H-symmetries are reduced to simple procedures on a puzzle via label swapping together with simple reflections of an equilateral triangle, that is, puzzle dualities, and rotations on an equilateral triangle.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olga Azenhas, Alessandro Conflitti, Ricardo Mamede. 2025-01-03. A uniform action of the dihedral group $ Z_2\times D_3$ on Littlewood--Richardson coefficients. https://arxiv.org/abs/2501.01947

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↗