Pattern avoidance classes and subpermutations

Simple item page
dc.creatorAtkinson, M. D.
dc.creatorMurphy, M. M.
dc.creatorRuskuc, N.
dc.date2004-02-11
dc.date.accessioned2026-07-07T05:05:22Z
dc.date.available2026-07-07T05:05:22Z
dc.descriptionPattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
dc.description18 pages, 4 figures (all in-line)
dc.identifierhttps://arxiv.org/abs/math/0402186
dc.identifierhttp://arxiv.org/abs/math/0402186
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70141
dc.subjectCombinatorics
dc.subject05A05
dc.titlePattern avoidance classes and subpermutations
dc.typetext

Files

Collections

arXiv