Universal Layered Permutations

Authors

Michael Albert, University of OtagoFollow
Michael Engen, University of Florida
Jay Pantone, Marquette UniversityFollow
Vincent Vatter, University of Florida

Document Type

Article

Language

eng

Publication Date

2018

Publisher

Electronic Journal of Combinatorics

Source Publication

Electronic Journal of Combinatorics

Source ISSN

1077-8926

Abstract

We establish an exact formula for the length of the shortest permutation containing all layered permutations of length n, proving a conjecture of Gray.

Comments

Published version. Electronic Journal of Combinatorics, Vol. 25, No. 3 (2018). DOI. This article is © The authors. Released under the CC BY-ND license (International 4.0).

Jay Pantone was affiliated with Dartmouth College at the time of publication.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Recommended Citation

Albert, Michael; Engen, Michael; Pantone, Jay; and Vatter, Vincent, "Universal Layered Permutations" (2018). Mathematical and Statistical Science Faculty Research and Publications. 9.
https://epublications.marquette.edu/math_fac/9