Permutation Classes of Polynomial Growth

Simple item page
dc.creatorAlbert, M. H.
dc.creatorAtkinson, M. D.
dc.creatorBrignall, Robert
dc.date2006-03-14
dc.date2007-02-07
dc.date.accessioned2026-07-07T07:45:02Z
dc.date.available2026-07-07T07:45:02Z
dc.descriptionA pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue of all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.
dc.description17 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0603315
dc.identifierhttp://arxiv.org/abs/math/0603315
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123409
dc.subjectCombinatorics
dc.subject05A15 (Primary), 05A05 (Secondary)
dc.titlePermutation Classes of Polynomial Growth
dc.typetext

Files

Collections

arXiv