A Construction of Short Sequences Containing All Permutations of a Set as Subsequences

[摘要] A sequence over a fixed finite set is said to be complete if it contains all permutations of the set as subsequences. Determining the length of shortest complete sequences is an open problem. We improve the existing upper bound and introduce tools to manu

[学科分类] 离散数学和组合数学

[关键词] Combinatorics on Words;Shortest Sequences;Permutations