The enumeration of simple permutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A 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.
22 pages, 1 figure, submitted to the Journal of Integer Sequences

Keywords

Combinatorics, 05A05 (Primary) 05A15, 05A16, 11A0 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/67100

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0304213
 http://arxiv.org/abs/math/0304213

Collections

arXiv