Domino Fibonacci tableaux
Summary: In 2001, \textit{M. Shimozono} and \textit{D. E. White} [Electron. J. Comb. 8, No.~1, Research paper R21 (2001; Zbl 0965.05095)] gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeu\-wen with the ``color-to-spin property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley's Fibonacci lattice \(Z(2)\), and define domino Fibonacci tableaux. We give an insertion algorithm which takes colored permutations to pairs of tableaux \((P,Q)\) of domino Fibonacci shape. We then define a notion of spin for domino Fibonacci tableaux for which the insertion algorithm preserves the color-to-spin property. In addition, we give an evacuation algorithm for standard domino Fibonacci tableaux which relates the pairs of tableaux obtained from the domino insertion algorithm to the pairs of tableaux obtained from Fomin's growth diagrams.
- Young-Fibonacci insertion, tableauhedron and Kostka numbers
- \(k\)-ribbon Fibonacci tableaux
- Color-to-spin ribbon Schensted algorithms
- Some bijective correspondences involving domino tableaux
- scientific article; zbMATH DE number 1750694 (Why is no real title available?)
- Evacuation and a geometric construction for Fibonacci tableaux
- Sign balances and promotion order of Young-Fibonacci tableaux
This page was built for publication: Domino Fibonacci tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500964)