Universal layered permutations
classification
🧮 math.CO
keywords
layeredlengthpermutationsconjecturecontainingestablishexactformula
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.