2017/11/16 by Péter Burcsi, Burcsi, Péter, Zsuzsanna Lipták +4
Computer Science · #68R15 (Primary) #68W32 (Secondary) #Algorithms and Data Compression #Cellular Automata and Applications #Coding theory and cryptography #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM #msc:68R15 #msc:68W32
paper · pdf · doi:10.48550/arxiv.1711.06264
18 pages, 3 figures, 1 table
arxiv created 2017/11/16 · openalex publication_date 2017/11/16 · arxiv updated 2017/11/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural insight into the nature of sets of Parikh vectors as well as that of the Parikh set of a given string. We show its utility by proving some results on Parikh-de-Bruijn strings, the abelian analog of de-Bruijn sequences.