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

Simple item page
dc.creatorBernini, Antonio
dc.creatorFerrari, Luca
dc.creatorPinzani, Renzo
dc.date2007-11-21
dc.date.accessioned2026-07-07T08:44:15Z
dc.date.available2026-07-07T08:44:15Z
dc.descriptionThe 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.
dc.description18 pages, 13 figures
dc.identifierhttps://arxiv.org/abs/0711.3387
dc.identifierhttp://arxiv.org/abs/0711.3387
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142594
dc.subjectCombinatorics
dc.subject05A15; 05A10
dc.titleEnumeration of some classes of words avoiding two generalized patterns of length three
dc.typetext

Files

Collections

arXiv