The number of permutations with a given number of sequences
| dc.creator | Kollar, Marcus | |
| dc.date | 2006-10-15 | |
| dc.date.accessioned | 2026-07-07T07:29:05Z | |
| dc.date.available | 2026-07-07T07:29:05Z | |
| dc.description | 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). | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/math/0610462 | |
| dc.identifier | http://arxiv.org/abs/math/0610462 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/117971 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A15 | |
| dc.title | The number of permutations with a given number of sequences | |
| dc.type | text |