Some statistics on permutations avoiding generalized patterns

Simple item page
dc.creatorBernini, A.
dc.creatorBouvel, m.
dc.creatorFerrari, L.
dc.date2006-11-29
dc.date.accessioned2026-07-07T07:33:30Z
dc.date.available2026-07-07T07:33:30Z
dc.descriptionIn the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their lengths. Here we tackle the problem of refining this enumeration by considering the statistics "first/last entry". We give complete results for every generalized patterns of type $(1,2)$ or $(2,1)$ as well as for some cases of permutations avoiding a pair of generalized patterns of the above types.
dc.description5 figures
dc.identifierhttps://arxiv.org/abs/math/0611923
dc.identifierhttp://arxiv.org/abs/math/0611923
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119477
dc.subjectCombinatorics
dc.subject05A05
dc.titleSome statistics on permutations avoiding generalized patterns
dc.typetext

Files

Collections

arXiv