The structure of alternative tableaux (Q533344): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
A \textit{shape} is a Ferrers diagram with possibly empty rows or columns. An \textit{alternative tableau} (introduced by Xavier Viennot) is a shape with a partial filling of the cells with left arrows (\(\leftarrow\)) and up arrows (\(\uparrow\)), such that all cells pointed to by an arrow are empty. A \textit{permutation tableau} (introduced by A. Postnikov) is a shape with every cell filled by 0 or 1 so that {\parindent=6mm \begin{itemize}\item[(i)]each column contains at least one 1; and \item[(ii)]no cell filled by a 0 has simultaneously a 1 above it in the same column, and a 1 to its left in the same row. \end{itemize}} From the author's abstract: ``We exhibit a simple recursive structure for alternative tableaux, from which we can easily deduce a number of enumerative results. We also give bijections between these tableaux and certain classes of labelled trees. Finally, we exhibit a bijection with permutations and relate it to some other bijections that (have) already appeared in the literature.'' The author notes that \textit{A. Burstein} [``On some properties of permutation tableaux'', Ann.\ Comb.\ 11, No.\ 3--4, 355--368 (2007; Zbl 1141.05002)] has ``previously arrived at essentially the same forest structure that results from our decomposition.'' | |||
Property / review text: A \textit{shape} is a Ferrers diagram with possibly empty rows or columns. An \textit{alternative tableau} (introduced by Xavier Viennot) is a shape with a partial filling of the cells with left arrows (\(\leftarrow\)) and up arrows (\(\uparrow\)), such that all cells pointed to by an arrow are empty. A \textit{permutation tableau} (introduced by A. Postnikov) is a shape with every cell filled by 0 or 1 so that {\parindent=6mm \begin{itemize}\item[(i)]each column contains at least one 1; and \item[(ii)]no cell filled by a 0 has simultaneously a 1 above it in the same column, and a 1 to its left in the same row. \end{itemize}} From the author's abstract: ``We exhibit a simple recursive structure for alternative tableaux, from which we can easily deduce a number of enumerative results. We also give bijections between these tableaux and certain classes of labelled trees. Finally, we exhibit a bijection with permutations and relate it to some other bijections that (have) already appeared in the literature.'' The author notes that \textit{A. Burstein} [``On some properties of permutation tableaux'', Ann.\ Comb.\ 11, No.\ 3--4, 355--368 (2007; Zbl 1141.05002)] has ``previously arrived at essentially the same forest structure that results from our decomposition.'' / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: William G. Brown / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11P83 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5883065 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
asymmetric exclusion process | |||
Property / zbMATH Keywords: asymmetric exclusion process / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutations | |||
Property / zbMATH Keywords: permutations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation tableaux | |||
Property / zbMATH Keywords: permutation tableaux / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alternative tableaux | |||
Property / zbMATH Keywords: alternative tableaux / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alternating trees | |||
Property / zbMATH Keywords: alternating trees / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
shape | |||
Property / zbMATH Keywords: shape / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Ferrers diagram | |||
Property / zbMATH Keywords: Ferrers diagram / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047135328 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0908.4050 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asymmetric simple exclusion process with open boundaries and Askey–Wilson polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tableaux combinatorics for the asymmetric exclusion process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Markov Chain on Permutations which Projects to the PASEP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutation tableaux and permutation patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On some properties of permutation tableaux / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bijections for permutation tableaux / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total positivity for cominuscule Grassmannians. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Staircase tableaux, the asymmetric exclusion process, and Askey-Wilson polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial approach to jumping particles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact solution of a 1D asymmetric exclusion model using a matrix formulation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4375247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4236280 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4769056 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:52, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The structure of alternative tableaux |
scientific article |
Statements
The structure of alternative tableaux (English)
0 references
3 May 2011
0 references
A \textit{shape} is a Ferrers diagram with possibly empty rows or columns. An \textit{alternative tableau} (introduced by Xavier Viennot) is a shape with a partial filling of the cells with left arrows (\(\leftarrow\)) and up arrows (\(\uparrow\)), such that all cells pointed to by an arrow are empty. A \textit{permutation tableau} (introduced by A. Postnikov) is a shape with every cell filled by 0 or 1 so that {\parindent=6mm \begin{itemize}\item[(i)]each column contains at least one 1; and \item[(ii)]no cell filled by a 0 has simultaneously a 1 above it in the same column, and a 1 to its left in the same row. \end{itemize}} From the author's abstract: ``We exhibit a simple recursive structure for alternative tableaux, from which we can easily deduce a number of enumerative results. We also give bijections between these tableaux and certain classes of labelled trees. Finally, we exhibit a bijection with permutations and relate it to some other bijections that (have) already appeared in the literature.'' The author notes that \textit{A. Burstein} [``On some properties of permutation tableaux'', Ann.\ Comb.\ 11, No.\ 3--4, 355--368 (2007; Zbl 1141.05002)] has ``previously arrived at essentially the same forest structure that results from our decomposition.''
0 references
asymmetric exclusion process
0 references
permutations
0 references
permutation tableaux
0 references
alternative tableaux
0 references
alternating trees
0 references
shape
0 references
Ferrers diagram
0 references