Domino tableaux, Schutzenberger involution, and the symmetric group action
Arkady Berenstein, Anatol N. Kirillov
Abstract
Open-access reader
Arkady Berenstein, Anatol N. Kirillov
Abstract
Open-access reader
We define an action of the symmetric group on the set of domino tableaux, and prove that the number of domino tableaux of a given weight does not depend on the permutation of components of the last. A bijective proof of the well-known result due to J. Stembridge that the number of self-evacuating tableaux of a given shape is equal to that of domino tableaux of the same shape is given.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We define an action of the symmetric group on the set of domino tableaux, and prove that the number of domino tableaux of a given weight does not depend on the permutation of components of the last. A bijective proof of the well-known result due to J. Stembridge that the number of self-evacuating tableaux of a given shape is equal to that of domino tableaux of the same shape is given.
Key concepts: Domino, Young tableau, Symmetric group, Bijection, Combinatorics, Permutation group, Involution (esoterism), Mathematics