2022/01/17 by Oliver Tan, Tan, Oliver
Computer Science · Engineering · #05A05 #68R15 #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2201.06306
openalex publication_date 2022/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.