Search arXivSearch

arXiv · 2412.18058

Robinson-Schensted shapes arising from cycle decompositions

Abstract

In the symmetric group $S_n$, each element $σ$ has an associated cycle type $α$, a partition of $n$ that identifies the conjugacy class of $σ$. The Robinson-Schensted (RS) correspondence links each $σ$ to another partition $λ$ of $n$, representing the shape of the pair of Young tableaux produced by applying the RS row-insertion algorithm to $σ$. Surprisingly, the relationship between these two partitions, namely the cycle type $α$ and the RS shape $λ$, has only recently become a subject of study. In this work, we explicitly describe the set of RS shapes $λ$ that can arise from elements of each cycle type $α$ in cases where $α$ consists of two cycles. To do this, we introduce the notion of an $α$-coloring, where one colors the entries in a certain tableau of shape $λ$, in such a way as to construct a permutation $σ$ with cycle type $α$ and RS shape $λ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martha Du Preez, William Q. Erickson, Jonathan Feigert, Markus Hunziker, Jonathan Meddaugh, Mitchell Minyard, Mark R. Sepanski, Kyle Rosengartner. 2024-12-24. Robinson-Schensted shapes arising from cycle decompositions. https://arxiv.org/abs/2412.18058

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO