Universal layered permutations
The electronic journal of combinatorics, Tome 25 (2018) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We establish an exact formula for the length of the shortest permutation containing all layered permutations of length $n$, proving a conjecture of Gray.
DOI : 10.37236/7386
Classification : 05A05, 06A07
Mots-clés : permutation patterns, universal permutations

Michael Albert  1   ; Michael Engen  2   ; Jay Pantone  3   ; Vincent Vatter  2

1 University of Otago
2 University of Florida
3 Dartmouth College
@article{10_37236_7386,
     author = {Michael Albert and Michael Engen and Jay Pantone and Vincent Vatter},
     title = {Universal layered permutations},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {3},
     doi = {10.37236/7386},
     zbl = {1393.05003},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/7386/}
}
TY  - JOUR
AU  - Michael Albert
AU  - Michael Engen
AU  - Jay Pantone
AU  - Vincent Vatter
TI  - Universal layered permutations
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/7386/
DO  - 10.37236/7386
ID  - 10_37236_7386
ER  - 
%0 Journal Article
%A Michael Albert
%A Michael Engen
%A Jay Pantone
%A Vincent Vatter
%T Universal layered permutations
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/7386/
%R 10.37236/7386
%F 10_37236_7386
Michael Albert; Michael Engen; Jay Pantone; Vincent Vatter. Universal layered permutations. The electronic journal of combinatorics, Tome 25 (2018) no. 3. doi: 10.37236/7386

Cité par Sources :