Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00026-010-0053-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028855340 / rank | |||
Normal rank | |||
Revision as of 21:25, 19 March 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
