Universal layered permutations (Q1658771)
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 6918056
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal layered permutations |
scientific article; zbMATH DE number 6918056 |
Statements
Universal layered permutations (English)
0 references
15 August 2018
0 references
Summary: We establish an exact formula for the length of the shortest permutation containing all layered permutations of length \(n\), proving a conjecture of \textit{D. Gray} [Graphs Comb. 31, No. 4, 941--952 (2015; Zbl 1316.05001)].
0 references
permutation patterns
0 references
universal permutations
0 references
0.7692902684211731
0 references
0.7685429453849792
0 references
0.7679553627967834
0 references
0.7605640888214111
0 references
