Bijections for permutation tableaux (Q2519814)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bijections for permutation tableaux |
scientific article |
Statements
Bijections for permutation tableaux (English)
0 references
27 January 2009
0 references
In [J. Comb. Theory, Ser. A 114, 211-234 (2007; Zbl 1116.05003)], \textit{E. Steingrímsson} and \textit{L. K. Williams} introduce the concept of permutation tableaux, a class of 0/1-tableaux that are naturally in bijection with permutations. In particular, they give a bijection between permutation tableaux and permutations which allows to read several data of the permutation like exceedances, crossings, alignments from the corresponding tableau. In this paper, the authors propose two bijections between permutation tableaux and permutations which carry tableau statistics to descents, right-to-left minima, and occurrences of the generalized pattern 31-2 of permutations. Based on the correspondences, subclasses of permutation tableaux are defined that are in bijection with set partitions.
0 references
permutations
0 references
permutation tableaux
0 references
statistics
0 references
bijections
0 references
descents
0 references
right-to-left minima
0 references
permutation patterns
0 references
set partitions
0 references
0 references