Young-Fibonacci insertion, tableauhedron and Kostka numbers

DOI10.1016/J.JCTA.2008.05.010zbMATH Open1180.05122arXiv0704.1969OpenAlexW2083467738MaRDI QIDQ1003630FDOQ1003630

Janvier Nzeutchap

Publication date: 4 March 2009

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

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.

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

zbMATH Keywords

Kostka numberpermutohedronsaturated chainsFomin's growth diagramsOkada's algebraSchensted-FomintableauhedronYoung Fibonacci tableauxYoung-Fibonacci insertion algorithm

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Cites Work

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

Cited In (2)

• \(k\)-ribbon Fibonacci tableaux
• Sign balances and promotion order of Young-Fibonacci tableaux

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)