Linked partitions and permutation tableaux (Q396898): 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 | |||
Summary: Linked partitions were introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux were introduced by Steingrímsson and Williams in the study of totally positive Grassmannian cells. Let \([n]=\{1,2,\ldots,n\}\). Let \(L(n,k)\) denote the set of linked partitions of \([n]\) with \(k\) blocks, let \(P(n,k)\) denote the set of permutations of \([n]\) with \(k\) descents, and let \(T(n,k)\) denote the set of permutation tableaux of length \(n\) with \(k\) rows. Steingrímsson and Williams found a bijection between the set of permutation tableaux of length \(n\) with \(k\) rows and the set of permutations of \([n]\) with \(k\) weak excedances. Corteel and Nadeau gave a bijection between the set of permutation tableaux of length \(n\) with \(k\) columns and the set of permutations of \([n]\) with \(k\) descents. In this paper, we establish a bijection between \(L(n,k)\) and \(P(n,k-1)\) and a bijection between \(L(n,k)\) and \(T(n,k)\). Restricting the latter bijection to noncrossing linked partitions and nonnesting linked partitions, we find that the corresponding permutation tableaux can be characterized by pattern avoidance. | |||
Property / review text: Summary: Linked partitions were introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux were introduced by Steingrímsson and Williams in the study of totally positive Grassmannian cells. Let \([n]=\{1,2,\ldots,n\}\). Let \(L(n,k)\) denote the set of linked partitions of \([n]\) with \(k\) blocks, let \(P(n,k)\) denote the set of permutations of \([n]\) with \(k\) descents, and let \(T(n,k)\) denote the set of permutation tableaux of length \(n\) with \(k\) rows. Steingrímsson and Williams found a bijection between the set of permutation tableaux of length \(n\) with \(k\) rows and the set of permutations of \([n]\) with \(k\) weak excedances. Corteel and Nadeau gave a bijection between the set of permutation tableaux of length \(n\) with \(k\) columns and the set of permutations of \([n]\) with \(k\) descents. In this paper, we establish a bijection between \(L(n,k)\) and \(P(n,k-1)\) and a bijection between \(L(n,k)\) and \(T(n,k)\). Restricting the latter bijection to noncrossing linked partitions and nonnesting linked partitions, we find that the corresponding permutation tableaux can be characterized by pattern avoidance. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A19 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6330325 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
linked partition | |||
Property / zbMATH Keywords: linked partition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation | |||
Property / zbMATH Keywords: permutation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
descent | |||
Property / zbMATH Keywords: descent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
permutation tableau | |||
Property / zbMATH Keywords: permutation tableau / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1305.5357 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linked partitions and linked cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial derivation of the PASEP stationary state / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bijections for permutation tableaux / 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: Erratum to ``Tableaux combinatorics for the asymmetric exclusion process and Askey-Wilson polynomials'' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multilinear function series and transforms in free probability theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4443440 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutation tableaux and permutation patterns / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:16, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linked partitions and permutation tableaux |
scientific article |
Statements
Linked partitions and permutation tableaux (English)
0 references
14 August 2014
0 references
Summary: Linked partitions were introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux were introduced by Steingrímsson and Williams in the study of totally positive Grassmannian cells. Let \([n]=\{1,2,\ldots,n\}\). Let \(L(n,k)\) denote the set of linked partitions of \([n]\) with \(k\) blocks, let \(P(n,k)\) denote the set of permutations of \([n]\) with \(k\) descents, and let \(T(n,k)\) denote the set of permutation tableaux of length \(n\) with \(k\) rows. Steingrímsson and Williams found a bijection between the set of permutation tableaux of length \(n\) with \(k\) rows and the set of permutations of \([n]\) with \(k\) weak excedances. Corteel and Nadeau gave a bijection between the set of permutation tableaux of length \(n\) with \(k\) columns and the set of permutations of \([n]\) with \(k\) descents. In this paper, we establish a bijection between \(L(n,k)\) and \(P(n,k-1)\) and a bijection between \(L(n,k)\) and \(T(n,k)\). Restricting the latter bijection to noncrossing linked partitions and nonnesting linked partitions, we find that the corresponding permutation tableaux can be characterized by pattern avoidance.
0 references
linked partition
0 references
permutation
0 references
descent
0 references
permutation tableau
0 references
0 references