Enumerating \(r\)c-invariant permutations with no long decreasing subsequences (Q659582)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5999744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating \(r\)c-invariant permutations with no long decreasing subsequences |
scientific article; zbMATH DE number 5999744 |
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
0.7702707648277283
0 references
0.7640247344970703
0 references
0.7605306506156921
0 references
0.7485705614089966
0 references
