2003/04/15 by Michael Albert, M. H. Albert, Albert, M. H. +5 · 4 citations
Computer Science · Mathematics · #05A05 (Primary) 05A15 #05A16 #11A0 (Secondary) #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:05A15 #msc:05A16 #msc:11A0
paper · pdf · doi:10.48550/arxiv.math/0304213
22 pages, 1 figure, submitted to the Journal of Integer Sequences
arxiv created 2003/04/15 · openalex publication_date 2003/04/15 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.