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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
18 pages, 13 figures

Keywords

Combinatorics, 05A15; 05A10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142594

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0711.3387
 http://arxiv.org/abs/0711.3387

Collections

arXiv