An Potential Solution to the Length of the Shortest Superpattern

Jian Park
October 25, 2018
Abstract:

This paper is an extension of Jay Pantone’s paper “A lower bound on the length of the
shortest superpattern”. It aims to define a method to formulate an n-th cycle definition that
improves the lower bound for the generalized length of the minimal superpattern.

Definitions:

Let us say [n] is a set of k distinct numbers where [n] ∈ {1, . . . , k},

Let D[n] be the shortest length of a superpattern containing every possible permutation of [n]
consecutively.

Let a t-perfect cycle be a t-cycle with all possible permutations; Let a t-imperfect cycle be a t-
cycle without all possible permutations.

1) Creating an n-cycle

Fig 1: A 2-imperfect cycle where k=5

First, by analyzing trivial cases with low values of k, it is important to note that cycle
lengths tend to equal k-1 for k > 0. For example, the shortest superpattern for k = 1 is 1, which is
a 0-cycle. The shortest superpattern for k = 2 is 121, which is a 1-cycle, and the shortest
superpattern for k = 3 is 123121321, which is a 2-cycle. The first question to ask is whether this
pattern holds for all values of k.
 Before answering this question, let us first define a n-cycle. Through a natural extension
of the definition of the 2-cycle provided in Pantone’s paper, a 3-cycle can be defined as follows:

1. Starting with set [n], create a 1-cycle that ends at [n’]

2. Take the last n-2 digits and make them into [n’’]. During the first 1-cycle, the same
pattern of n-2 digits must have occurred, so choose the permutation that does not exist
yet.
3. Repeat steps 1 and 2 where the [n] of step 1 is always replaced by the [n’’] generated
from step 2 of the previous cycle (Repeat until the cycle is done n-1 times). Let [n’’’] be
the result at the end.
4. Repeat steps 1,2, and 3 where [n’’’] replaces every [n] after every 2-cycle.

Therefore, by continuously expanding upon step 3 and 4, it is possible to make a n-cycle

"!
that traverses distinct permutations of [n]. Using pigeon hole principal, it can be confirmed
"$% !
that a (k-1)-cycle will always be complete when [n] has k elements.

Fig 2: A 3-perfect cycle of k=3 based off the definition

2) Length of a n-cycle

Within an n-cycle, there is 2! (n-1)-cycles, 3! (n-2)-cycles, 4! (n-3)-cycles, etc. The

length of a superset formed by a k-perfect cycle can be determined by adding 1 to each number
transition, adding 1 to any transition that is 2-cycle or higher, adding another 1 to any transition
that is 3-cycle or higher, etc. There are k!-1 transitions, (k-1)!-1 transitions 2-cycle or higher, and
this continues to (2)!-1 transitions of (k-1)-cycle. Therefore, the end sum equals
 * *

𝑘 − 𝑛 ! − 1 = −𝑘 + 𝑛 !
%+, %+/

By adding the k letters for the final digit, the final solution becomes
*

𝑛 !
%+/