Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9909119

Some bijective correspondences involving domino tableaux

Marc A. A. van Leeuwen
View original source ↗Read source document ↗Export metadata ↓

Abstract

We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely parallels the structure defined in [math.CO/9908099] for ordinary skew semistandard tableaux, that is related to the Littlewood-Richardson rule. These operations are: (1) a bijection between semistandard domino tableaux and certain pairs of ordinary tableaux of the same weight that together fill the same shape; (2) a weight preserving transformation of domino tableaux to ordinary tableaux of a related shape (the correspondence involves 2-quotients) with the property that Yamanouchi domino tableaux correspond precisely to Littlewood-Richardson tableaux; (3) a correspondence between Yamanouchi domino tableaux of shape $λ$ and weight $μ$ and Yamanouchi domino tableaux of shape $μ'$ and weight $λ$, where $μ'$ is $μ$ scaled by a factor 2. The property at the heart of the structure so defined is that operations (1) and (2) commute with the coplactic operations (implicitly) defined by Carre and Leclerc. (1) elucidates their bijection analogous to that of Robinson (a.k.a. the Robinson-Schensted correspondence), while the operation of moving chains in domino tableaux underlying (2) is very similar to jeu de taquin.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marc A. A. van Leeuwen. 1999-09-21. Some bijective correspondences involving domino tableaux. https://arxiv.org/abs/math/9909119

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

KEEP EXPLORING

Related papers

arXiv2026

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO↗
arXiv2026

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO↗
arXiv2026

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO↗