Permutation tableaux and the dashed permutation pattern 32-1 (Q540121): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: We give a solution to a problem posed by Corteel and Nadeau concerning the permutation tableaux of length \(n\) and the number of occurrences of the dashed pattern 32-1 in permutations on \([n]\). We introduce the inversion number of a permutation tableaux. For a permutation tableaux \(T\) and the permutation \(\pi\) obtained from \(T\) by the bijection of Corteel and Nadeau, we show that the inversion number of \(T\) equals the number of occurrences of the dashed pattern 32-1 in the reverse complement of \(\pi \). We also show that the permutation tableaux without inversions coincide with the L-Bell tableaux introduced by Corteel and Nadeau. | |||
| Property / review text: Summary: We give a solution to a problem posed by Corteel and Nadeau concerning the permutation tableaux of length \(n\) and the number of occurrences of the dashed pattern 32-1 in permutations on \([n]\). We introduce the inversion number of a permutation tableaux. For a permutation tableaux \(T\) and the permutation \(\pi\) obtained from \(T\) by the bijection of Corteel and Nadeau, we show that the inversion number of \(T\) equals the number of occurrences of the dashed pattern 32-1 in the reverse complement of \(\pi \). We also show that the permutation tableaux without inversions coincide with the L-Bell tableaux introduced by Corteel and Nadeau. / 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: 5903041 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
L-Bell tableaux | |||
| Property / zbMATH Keywords: L-Bell tableaux / rank | |||
Normal rank | |||
Revision as of 10:00, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Permutation tableaux and the dashed permutation pattern 32-1 |
scientific article |
Statements
Permutation tableaux and the dashed permutation pattern 32-1 (English)
0 references
1 June 2011
0 references
Summary: We give a solution to a problem posed by Corteel and Nadeau concerning the permutation tableaux of length \(n\) and the number of occurrences of the dashed pattern 32-1 in permutations on \([n]\). We introduce the inversion number of a permutation tableaux. For a permutation tableaux \(T\) and the permutation \(\pi\) obtained from \(T\) by the bijection of Corteel and Nadeau, we show that the inversion number of \(T\) equals the number of occurrences of the dashed pattern 32-1 in the reverse complement of \(\pi \). We also show that the permutation tableaux without inversions coincide with the L-Bell tableaux introduced by Corteel and Nadeau.
0 references
L-Bell tableaux
0 references
