Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00026-010-0053-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00026-010-0053-6 / rank | |||
Normal rank | |||
Latest revision as of 00:09, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumerating \(r\)c-invariant permutations with no long decreasing subsequences |
scientific article |
Statements
Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (English)
0 references
24 January 2012
0 references
domino tableaux
0 references
pattern-avoiding permutation
0 references
restricted permutation
0 references
reversecomplement map
0 references
Robinson-Schensted-Knuth correspondence
0 references
tableaux
0 references
0 references
0 references
