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

Tools

Chen, Herman Z.Q. and Kitaev, Sergey and Sun, Brian Y. (2020) 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. Mathematics, 8 (5). 778. (https://doi.org/10.3390/math8050778)

[thumbnail of Chen-etal-Mathematics-2020-Lower-bounds-and-exact-enumeration-in-particular-cases]
Preview
 Text. Filename: Chen_etal_Mathematics_2020_Lower_bounds_and_exact_enumeration_in_particular_cases.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (272kB)| Preview

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.

ORCID iDs

Chen, Herman Z.Q., Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647 and Sun, Brian Y.;
CORE (COnnecting REpositories)