Decomposing simple permutations, with enumerative consequences

Simple item page
dc.creatorBrignall, Robert
dc.creatorHuczynska, Sophie
dc.creatorVatter, Vince
dc.date2006-06-08
dc.date.accessioned2026-07-07T07:17:05Z
dc.date.available2026-07-07T07:17:05Z
dc.descriptionWe prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bona and (independently) Mansour and Vainshtein that for any r, the number of permutations with at most r copies of 132 has an algebraic generating function.
dc.identifierhttps://arxiv.org/abs/math/0606186
dc.identifierhttp://arxiv.org/abs/math/0606186
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113814
dc.subjectCombinatorics
dc.titleDecomposing simple permutations, with enumerative consequences
dc.typetext

Files

Collections

arXiv