Tree-like tableaux
Summary: 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 tree-like 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.
- A Markov Chain on Permutations which Projects to the PASEP
- Bijections for permutation tableaux
- Combinatorics of non-ambiguous trees
- Combinatorics on permutation tableaux of type A and type B
- Crossings of signed permutations and \(q\)-Eulerian numbers of type \(B\)
- Enumeration of totally positive Grassmann cells
- Expected values of statistics on permutation tableaux
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- On some properties of permutation tableaux
- Permutation tableaux and permutation patterns
- Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials
- Tableaux combinatorics for the asymmetric exclusion process
- The structure of alternative tableaux
- The tree structure in staircase tableaux
- Total positivity for cominuscule Grassmannians.
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- Rhombic alternative tableaux and assemblées of permutations
- Non-ambiguous trees: new results and generalisation
- Combinatorics of faithfully balanced modules
- Stieltjes moment properties and continued fractions from combinatorial triangles
- Eulerian pairs and Eulerian recurrence systems
- An asymptotic distribution theory for Eulerian recurrences with applications
- The number of directed \(k\)-convex polyominoes
- The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
- A generalized Eulerian triangle from staircase tableaux and tree-like tableaux
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- Dyck tilings, increasing trees, descents, and inversions
- Context-free grammars, generating functions and combinatorial arrays
- Combinatorics on permutation tableaux of type A and type B
- Tree-like tableaux
- Asymptotic normality of the number of corners in tableaux associated with the partially asymmetric simple exclusion process
- Combinatorics of non-ambiguous trees
- The tree structure in staircase tableaux
- Refined enumeration of corners in tree-like tableaux
- Corners in tree-like tableaux
- Distribution of the number of corners in tree-like and permutation tableaux
- Non-ambiguous trees: new results and generalization
- Rhombic alternative tableaux, assemblees of permutations, and the ASEP
- The structure of alternative tableaux
- scientific article; zbMATH DE number 5026365 (Why is no real title available?)
- Interview with Xavier Viennot
- scientific article; zbMATH DE number 7731162 (Why is no real title available?)
- Associated permutations of complete non-ambiguous trees
- Corners in tree-like tableaux
This page was built for publication: Tree-like tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396965)
