On the Parikh-de-Bruijn grid
Discrete Mathematics
2017-11-20 v1
Abstract
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.
Cite
@article{arxiv.1711.06264,
title = {On the Parikh-de-Bruijn grid},
author = {Péter Burcsi and Zsuzsanna Lipták and W. F. Smyth},
journal= {arXiv preprint arXiv:1711.06264},
year = {2017}
}
Comments
18 pages, 3 figures, 1 table