IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i5p778-d357245.html
   My bibliography  Save this article

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

Author

Listed:
  • Herman Z. Q. Chen

    (School of Statistics and Data Science, Nankai University, Tianjin 300071, China)

  • Sergey Kitaev

    (Department of Mathematics and Statistics, University of Strathclyde, Glasgow G1 1XH, UK)

  • Brian Y. Sun

    (College of Mathematics and System Science, Xinjiang University, Urumqi, Xinjiang 830046, China)

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 the 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 .

Suggested Citation

  • Herman Z. Q. Chen & Sergey Kitaev & Brian Y. Sun, 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, MDPI, vol. 8(5), pages 1-11, May.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:5:p:778-:d:357245
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/5/778/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/5/778/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:5:p:778-:d:357245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.