A construction of short sequences containing all permutations of a set as subsequences

Saša Radomirović (Lead / Corresponding author)

Research output: Contribution to journalArticle

5 Citations (Scopus)
52 Downloads (Pure)

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 languageEnglish
Article number31
Pages (from-to)1-11
Number of pages11
JournalElectronic Journal of Combinatorics
Volume19
Issue number4
Publication statusPublished - 22 Nov 2012

Keywords

  • Combinatorics on words
  • Shortest sequences
  • Permutations

Fingerprint Dive into the research topics of 'A construction of short sequences containing all permutations of a set as subsequences'. Together they form a unique fingerprint.

  • Cite this