The structure of alternative tableaux
From MaRDI portal
Publication:533344
DOI10.1016/J.JCTA.2011.01.012zbMATH Open1235.05014OpenAlexW2047135328MaRDI QIDQ533344FDOQ533344
Abstract: In this paper we study alternative tableaux introduced by Viennot. These tableaux are in simple bijection with permutation tableaux, defined previously by Postnikov . We exhibit a simple recursive structure for alternative tableaux. From this decomposition, we can easily deduce a number of enumerative results. We also give bijections between these tableaux and certain classes of labeled trees. Finally, we exhibit a bijection with permutations, and relate it to some other bijections that already appeared in the literature.
Recommendations
- Tree-like tableaux
- Tree-like tableaux
- Combinatorics on permutation tableaux of type A and type B
- Bijections for permutation tableaux
- Bijections for permutation tableaux
- scientific article; zbMATH DE number 7731162
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- Permutrees
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Priority queue sorting and labeled trees
Cites Work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- A Markov Chain on Permutations which Projects to the PASEP
- A combinatorial approach to jumping particles
- Analytic combinatorics
- Asymmetric simple exclusion process with open boundaries and Askey–Wilson polynomials
- Bijections for permutation tableaux
- Exact solution of a 1D asymmetric exclusion model using a matrix formulation
- 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
- Total positivity for cominuscule Grassmannians.
Cited In (29)
- Tree-like tableaux
- A shifted analogue to ribbon tableaux
- The Matrix Ansatz, orthogonal polynomials, and permutations
- Tree-like tableaux
- The tree structure in staircase tableaux
- Generalized Dumont-Foata polynomials and alternative tableaux
- New interpretations for noncrossing partitions of classical types
- A combinatorial proof of a symmetry of \((t,q)\)-Eulerian numbers of type \(B\) and type \(D\)
- Block decomposition and statistics arising from permutation tableaux
- Weighted random staircase tableaux
- Corners in tree-like tableaux
- EXPtime tableaux for ALC
- A generalized Eulerian triangle from staircase tableaux and tree-like tableaux
- Multivariate Eulerian polynomials and exclusion processes
- Combinatorics on permutation tableaux of type A and type B
- Moments of Askey-Wilson polynomials
- Formulae for Askey-Wilson moments and enumeration of staircase tableaux
- The parity of the number of permutation tableaux in a fixed shape
- Bijective enumerations for symmetrized poly-Bernoulli polynomials
- Combinatorics of the 2-species exclusion processes, marked Laguerre histories, and partially signed permutations
- Combinatorics of non-ambiguous trees
- On the combinatorics of symmetrized poly-Bernoulli numbers
- A bijection from staircase tableaux to inversion tables, giving some Eulerian and Mahonian statistics
- Title not available (Why is no real title available?)
- Permutation statistics and weak Bruhat order in permutation tableaux of type \(B\)
- Rhombic alternative tableaux and assemblées of permutations
- Context-free grammars, generating functions and combinatorial arrays
- Combinatorics of faithfully balanced modules
- Title not available (Why is no real title available?)
This page was built for publication: The structure of alternative tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533344)
