pith. sign in

arxiv: 1711.06264 · v1 · pith:WIQPKCABnew · submitted 2017-11-16 · 💻 cs.DM

On the Parikh-de-Bruijn grid

classification 💻 cs.DM
keywords parikhparikh-de-bruijngivengraphgridvectorswhoseabelian
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.