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

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 numberP31
JournalElectronic Journal of Combinatorics
Volume19
Issue number4
DOIs
Publication statusPublished - 22 Nov 2012

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

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