The enumeration of simple permutations
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0304213,
title = {The enumeration of simple permutations},
author = {M. H. Albert and M. D. Atkinson and M. Klazar},
journal= {arXiv preprint arXiv:math/0304213},
year = {2007}
}
备注
22 pages, 1 figure, submitted to the Journal of Integer Sequences