Enumerating permutations avoiding more than three Babson - Steingr\'ımsson patterns

Simple item page
dc.creatorBernini, Antonio
dc.creatorPergola, Elisa
dc.date2007-04-26
dc.date.accessioned2026-07-07T07:58:22Z
dc.date.available2026-07-07T07:58:22Z
dc.descriptionNot long ago, Claesson and Mansour proposed some conjectures about the enumeration of the permutations avoiding more than three Babson - Steingr\'ımsson patterns (generalized patterns of type $(1,2)$ or $(2,1)$). The avoidance of one, two or three patterns has already been considered. Here, the cases of four and five forbidden patterns are solved and the exact enumeration of the permutations avoiding them is given, confirming the conjectures of Claesson and Mansour. The approach we use can be easily extended to the cases of more than five forbidden patterns.
dc.identifierhttps://arxiv.org/abs/0704.3565
dc.identifierhttp://arxiv.org/abs/0704.3565
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127985
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleEnumerating permutations avoiding more than three Babson - Steingr\'ımsson patterns
dc.typetext

Files

Collections

arXiv