Lower bounds, and exact enumeration in particular cases, for the probability of existence of a universal cycle or a universal word for a set of words

Herman Z.Q. Chen, Sergey Kitaev, Brian Y. Sun

Research output: Contribution to journalArticle

Abstract

A universal cycle, or u-cycle, for a given set of words is a circular word that contains each word from the set exactly once as a contiguous subword. The celebrated de Bruijn sequences are a particular case of such a u-cycle, where a set in question is the set A^n of all words of length n over a k-letter alphabet A. A universal word, or u-word, is a linear, i.e., non-circular, version of thuniversal cycle; u-cycle; universal word; u-word; de Bruijn sequencee notion of a u-cycle, and it is defined similarly. Removing some words in A^n may, or may not, result in a set of words for which u-cycle, or u-word, exists. The goal of this paper is to study the probability of existence of the universal objects in such a situation. We give lower bounds for the probability in general cases, and also derive explicit answers for the case of removing up to two words in A^n, or the case when k = 2 and n ≤ 4.
Original languageEnglish
Article number778
Number of pages11
JournalMathematics
Volume8
Issue number5
DOIs
Publication statusPublished - 12 May 2020

Keywords

  • universal cycle
  • u-cycle
  • universal word
  • u-word
  • de Bruijn sequence

Cite this