Universal layered permutations

2017/10/11 by Albert, Michael, Engen, Michael, Pantone, Jay +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1710.04240

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.

Related

• Layered restrictions and Chebyshev polynomials
• Density maximizers of layered permutations
• An (almost) optimal answer to a question by Wilf
• The shallow permutations are the unlinked permutations
• On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length