arXiv Analytics

Sign in

arXiv:0711.3387 [math.CO]AbstractReferencesReviewsResources

Enumeration of some classes of words avoiding two generalized patterns of length three

Antonio Bernini, Luca Ferrari, Renzo Pinzani

Published 2007-11-21Version 1

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.

Comments: 18 pages, 13 figures
Categories: math.CO
Subjects: 05A15, 05A10
Related articles: Most relevant | Search more
arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)
Enumeration of m-ary cacti
arXiv:math/9904150 [math.CO] (Published 1999-04-27, updated 1999-04-28)
Enumeration of Matchings: Problems and Progress
arXiv:math/9810143 [math.CO] (Published 1998-10-23)
Enumeration of tilings of diamonds and hexagons with defects

Links

Toolbox