Abstract.
We study the length L k of the shortest permutation containing all patterns of length k. We establish the bounds e −2 k 2 < L k ≤ (2/3 + o(1))k 2. We also prove that as k → ∞, there are permutations of length (1/4 + o(1))k 2 containing almost all patterns of length k.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received January 2, 2007
Rights and permissions
About this article
Cite this article
Eriksson, H., Eriksson, K., Linusson, S. et al. Dense Packing of Patterns in a Permutation. Ann. Comb. 11, 459–470 (2007). https://doi.org/10.1007/s00026-007-0329-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-007-0329-7