Search arXivSearch

arXiv · math/0312020

Spin-preserving Knuth correspondences for ribbon tableaux

Abstract

The RSK correspondence generalises the Robinson-Schensted correspondence by replacing permutation matrices by matrices with entries in ${\bf N}$, and standard Young tableaux by semistandard ones. For $r>0$, the Robinson-Schensted correspondence can be trivially extended, using the $r$-quotient map, to one between coloured permutations and pairs of standard $r$-ribbon tableaux built on a fixed $r$-core (the Stanton-White correspondence). This correspondence can also be generalised to arbitrary matrices with entries in ${\bf N}^r$ and pairs of semistandard $r$-ribbon tableaux built on a fixed $r$-core; the generalisation is derived from the RSK correspondence, again using the $r$-quotient map. Shimozono and White recently defined a more interesting generalisation of the Robinson-Schensted correspondence to coloured permutations and standard $r$-ribbon tableaux, one that (unlike the Stanton-White correspondence) respects the spin statistic (total height of ribbons) on standard $r$-ribbon tableaux, relating it directly to the colours of the coloured permutation. We define a construction establishing a bijective correspondence between general matrices with entries in ${\bf N}^r$ and pairs of semistandard $r$-ribbon tableaux built on a fixed $r$-core, which respects the spin statistic on those tableaux in a similar manner, relating it directly to the matrix entries. We also define a similar generalisation of the asymmetric RSK correspondence, in which case the matrix entries are taken from $\{0,1\}^r$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marc A. A. Van Leeuwen. 2003-12-01. Spin-preserving Knuth correspondences for ribbon tableaux. https://arxiv.org/abs/math/0312020

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