搜索结果: 1-1 共查到“组合数学 length”相关记录1条 . 查询时间(0.046 秒)
Permutations all of whose patterns of a given length are distinct
Permutations a given length distinct Combinatorics
2012/6/21
For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3}...