|
|
|
|
| LEADER |
01198 am a22001933u 4500 |
| 001 |
91153 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Gunby, Benjamin P.
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Gunby, Benjamin P.
|e contributor
|
| 245 |
0 |
0 |
|a The maximal length of a k-separator permutation
|
| 260 |
|
|
|b Electronic Journal of Combinatorics,
|c 2014-10-23T16:57:43Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/91153
|
| 520 |
|
|
|a A permutation σ ∈ S[subscript n] is a k-separator if all of its patterns of length k are distinct. Let F(k) denote the maximal length of a k-separator. Hegarty (2013) showed that k + ⌊√2k − 1⌋ − 1 ≤ F(k) ≤ k + ⌊√2k − 3⌋, and conjectured that F(k) = k + ⌊√2k − 1⌋ − 1. This paper will strengthen the upper bound to prove the conjecture for all sufficiently large k (in particular, for all k ≥ 320801).
|
| 520 |
|
|
|a United States. Dept. of Energy. Division of Materials Sciences and Engineering (Grant 1062709)
|
| 520 |
|
|
|a United States. National Security Agency (Grant H98230-11-1-0224)
|
| 546 |
|
|
|a en_US
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t Electronic Journal of Combinatorics
|
