arXiv Analytics

Sign in

arXiv:math/0610462 [math.CO]AbstractReferencesReviewsResources

The number of permutations with a given number of sequences

Marcus Kollar

Published 2006-10-15Version 1

P(n,s) denotes the number of permutations of 1,2,...n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P(n,s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P(n,s) and its fixed-s generating function u_s(x).

Comments: 5 pages
Categories: math.CO
Subjects: 05A15
Related articles: Most relevant | Search more
arXiv:1303.3857 [math.CO] (Published 2013-03-15)
The number of {1243, 2134}-avoiding permutations
arXiv:0904.2792 [math.CO] (Published 2009-04-17)
The largest and the smallest fixed points of permutations
arXiv:0901.2008 [math.CO] (Published 2009-01-14)
Two Enumerative Results on Cycles of Permutations

Links

Toolbox