论文标题
跳过所有排列的简短超平等的信件
Skip Letters for Short Supersequence of All Permutations
论文作者
论文摘要
有限集的超级是一个序列，该序列包含该集合的所有排列。本文定义了一系列无限的方法来创建长度减小的超股式。这在较大的集合上产生了最短的已知超股权。它还渐近地提供了最佳结果。它基于使用称为“完整性”的新属性的一般证明。同样的技术也可以用来证明现有的超级股权，将新旧技术结合到统一的概念框架中。
A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known supersequences over larger sets. It also provides the best results asymptotically. It is based on a general proof using a new property called strong completeness. The same technique also can be used to prove existing supersequences which combines the old and new ones into an unified conceptual framework.
