Abstract
A sequence over a fixed finite set is said to be complete if it contains all per- mutations 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.
| Original language | English |
|---|---|
| Article number | 31 |
| Pages (from-to) | 1-11 |
| Number of pages | 11 |
| Journal | Electronic Journal of Combinatorics |
| Volume | 19 |
| Issue number | 4 |
| Publication status | Published - 22 Nov 2012 |
Keywords
- Combinatorics on words
- Shortest sequences
- Permutations
ASJC Scopus subject areas
- Geometry and Topology
- Theoretical Computer Science
- Computational Theory and Mathematics