Young-Fibonacci insertion, tableauhedron and Kostka numbers

DOI10.1016/J.JCTA.2008.05.010MaRDI QIDQ1003630zbMATH OpenOpenAlexFDO

Authors Janvier Nzeutchap

Publication date 4 March 2009

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0704.1969

zbMATH Keywords

Fomin's growth diagramsKostka numberOkada's algebrapermutohedronsaturated chainsSchensted-FomintableauhedronYoung Fibonacci tableauxYoung-Fibonacci insertion algorithm

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Abstract: This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algebra associated to the Young-Fibonacci lattice. The original algorithm was introduced by Roby and we redefine it in such a way that both the insertion and recording tableaux of any permutation are emph{conveniently} interpreted as chains in the Young-Fibonacci lattice. A property of Killpatrick's evacuation is given a simpler proof, but this evacuation is no longer needed in making Roby's and Fomin's constructions coincide. We provide the set of Young-Fibonacci tableaux of size $n$ with a structure of graded poset, induced by the weak order on permutations of the symmetric group, and realized by transitive closure of elementary transformations on tableaux. We show that this poset gives a combinatorial interpretation of the coefficients in the transition matrix from the analogue of complete symmetric functions to analogue of the Schur functions in Okada's algebra. We end with a quite similar observation for four posets on Young-tableaux studied by Taskin.

Recommendations

• \(k\)-ribbon Fibonacci tableaux
• Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
• Evacuation and a geometric construction for Fibonacci tableaux
• Domino Fibonacci tableaux
• Algebras Associated to the Young-Fibonacci Lattice

Cites work

• Algebras Associated to the Young-Fibonacci Lattice
• Duality of graded graphs
• Evacuation and a geometric construction for Fibonacci tableaux
• scientific article; zbMATH DE number 4079428 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3513846 (Why is no real title available?)
• Longest Increasing and Decreasing Subsequences
• MuPAD-Combinat, an open-source package for research in algebraic combinatorics
• Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
• On orbital variety closures in \(\mathfrak{sl}_n\). I: Induced Duflo order.
• Properties of four partial orders on standard Young tableaux
• Schensted algorithms for dual graded graphs
• The algebra of binary search trees

Cited in

(6)

• \(k\)-ribbon Fibonacci tableaux
• Algebras Associated to the Young-Fibonacci Lattice
• Evacuation and a geometric construction for Fibonacci tableaux
• Sign balances and promotion order of Young-Fibonacci tableaux
• Random Fibonacci words via clone Schur functions
• Diagram model for the Okada algebra and monoid

Describes a project that uses

Uses Software

• MuPAD-Combinat

This page was built for publication: Young-Fibonacci insertion, tableauhedron and Kostka numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003630)