Skip to Main content Skip to Navigation
Conference papers

Tree-like tableaux

Abstract : In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally on alternative and permutation tableaux. Our insertion procedure allows to define in particular two simple new bijections between tree-like tableaux and permutations: the first one is conceived specifically to respect the generalized pattern 2-31, while the second one respects the underlying tree of a tree-like tableau.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 3:06:37 PM
Last modification on : Saturday, June 25, 2022 - 10:35:56 AM
Long-term archiving on: : Thursday, April 27, 2017 - 12:22:33 AM


Publisher files allowed on an open archive




Jean-Christophe Aval, Adrien Boussicault, Philippe Nadeau. Tree-like tableaux. 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), 2011, Reykjavik, Iceland. pp.63-74, ⟨10.46298/dmtcs.2891⟩. ⟨hal-01215092⟩



Record views


Files downloads