Enumeration of some classes of words avoiding two generalized patterns of length three
Combinatorics
2007-11-22 v1
Abstract
The method we have applied in "A. Bernini, L. Ferrari, R. Pinzani, Enumerating permutations avoiding three Babson-Steingrimsson patterns, Ann. Comb. 9 (2005), 137--162" to count pattern avoiding permutations is adapted to words. As an application, we enumerate several classes of words simultaneously avoiding two generalized patterns of length 3.
Cite
@article{arxiv.0711.3387,
title = {Enumeration of some classes of words avoiding two generalized patterns of length three},
author = {Antonio Bernini and Luca Ferrari and Renzo Pinzani},
journal= {arXiv preprint arXiv:0711.3387},
year = {2007}
}
Comments
18 pages, 13 figures