Universal layered permutations
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.