Counting occurrences of some subword patterns
Combinatorics
2007-05-23 v2
Abstract
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
Keywords
Cite
@article{arxiv.math/0204320,
title = {Counting occurrences of some subword patterns},
author = {A. Burstein and T. Mansour},
journal= {arXiv preprint arXiv:math/0204320},
year = {2007}
}
Comments
9 pages