Dense Packing of Patterns in a Permutation
Formal Power Series and Algebraic Combinatorics (link)(2008)
摘要
. 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 .
更多查看译文
关键词
pattern containment,permutation statistic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络