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.
Enumeration of some classes of words avoiding two generalized patterns of length 3 / Bernini, Antonio; Ferrari, Luca; Pinzani, Renzo. - STAMPA. - (2007), pp. 1-2. (Intervento presentato al convegno Permutation Patterns 2007 tenutosi a St. Andrews (Scotland) nel 11-15 giugno 2007).
Enumeration of some classes of words avoiding two generalized patterns of length 3
BERNINI, ANTONIO;FERRARI, LUCA;PINZANI, RENZO
2007
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
