The enumeration of simple permutations

Simple item page
dc.creatorAlbert, M. H.
dc.creatorAtkinson, M. D.
dc.creatorKlazar, M.
dc.date2003-04-15
dc.date.accessioned2026-07-07T04:56:56Z
dc.date.available2026-07-07T04:56:56Z
dc.descriptionA simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results include a straightforward relationship between the ordinary generating function for simple permutations and that for all permutations, that the coefficients of this series are not P-recursive, an asymptotic expansion for these coefficients, and a number of congruence results.
dc.description22 pages, 1 figure, submitted to the Journal of Integer Sequences
dc.identifierhttps://arxiv.org/abs/math/0304213
dc.identifierhttp://arxiv.org/abs/math/0304213
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67100
dc.subjectCombinatorics
dc.subject05A05 (Primary) 05A15, 05A16, 11A0 (Secondary)
dc.titleThe enumeration of simple permutations
dc.typetext

Files

Collections

arXiv