Universal layered permutations
Michael Albert, Michael Engen, Jay Pantone, Vincent Vatter
TL;DR
This paper derives an exact formula for the shortest permutation that contains all layered permutations of a given length, confirming a previous conjecture and advancing understanding of permutation containment.
Contribution
It provides a precise formula for the minimal length permutation containing all layered permutations, resolving Gray's conjecture.
Findings
Exact formula for shortest layered permutation length
Proof of Gray's conjecture
Advances in permutation containment theory
Abstract
We establish an exact formula for the length of the shortest permutation containing all layered permutations of length , proving a conjecture of Gray.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.