A construction of short sequences containing all permutations of a set as subsequences (Q1953339)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A construction of short sequences containing all permutations of a set as subsequences |
scientific article; zbMATH DE number 6171814
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A construction of short sequences containing all permutations of a set as subsequences |
scientific article; zbMATH DE number 6171814 |
Statements
A construction of short sequences containing all permutations of a set as subsequences (English)
0 references
7 June 2013
0 references
Summary: 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 manually prove the completeness of sequences.
0 references
combinatorics on words
0 references
shortest sequences
0 references
permutations
0 references
