Generalized de Bruijn words for Primitive words and Powers
Yu Hin Au

TL;DR
This paper introduces a method to construct words with circular factors corresponding to primitive words, explores connections between de Bruijn and Lyndon graphs, and analyzes the minimal length of words containing all p-powers, providing algorithms for these constructions.
Contribution
It presents a new construction of words related to primitive words and powers, and establishes bounds and algorithms for generating such words over finite alphabets.
Findings
Existence of words with circular factors corresponding to primitive words for all n
Connections established between de Bruijn graphs of primitive words and Lyndon graphs
Bounds and algorithms for shortest words containing all p-powers of a given length
Abstract
We show that for every and over any finite alphabet, there is a word whose circular factors of length have a one-to-one correspondence with the set of primitive words. In particular, we prove that such a word can be obtained by a greedy algorithm, or by concatenating all Lyndon words of length in increasing lexicographic order. We also look into connections between de Bruijn graphs of primitive words and Lyndon graphs. Finally, we also show that the shortest word that contains every -power of length over a -letter alphabet has length between and roughly , for all integers . An algorithm that generates a word which achieves the upper bound is provided.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
