Equivalence classes of ballot paths modulo strings of length 2 and 3
Combinatorics
2015-10-08 v1
Abstract
Two paths are equivalent modulo a given string , whenever they have the same length and the positions of the occurrences of are the same in both paths. This equivalence relation was introduced for Dyck paths in \cite{BP}, where the number of equivalence classes was evaluated for any string of length 2. In this paper, we evaluate the number of equivalence classes in the set of ballot paths for any string of length 2 and 3, as well as in the set of Dyck paths for any string of length 3.
Keywords
Cite
@article{arxiv.1510.01952,
title = {Equivalence classes of ballot paths modulo strings of length 2 and 3},
author = {K. Manes and A. Sapounakis and I. Tasoulas and P. Tsikouras},
journal= {arXiv preprint arXiv:1510.01952},
year = {2015}
}