Counting permutations by their runs up and down

Simple item page
dc.creatorCanfield, E. Rodney
dc.creatorWilf, Herbert S.
dc.date2006-09-25
dc.date.accessioned2026-07-07T07:25:14Z
dc.date.available2026-07-07T07:25:14Z
dc.descriptionWe find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
dc.description12 pages
dc.identifierhttps://arxiv.org/abs/math/0609704
dc.identifierhttp://arxiv.org/abs/math/0609704
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116649
dc.subjectCombinatorics
dc.subject05A15; 05A16
dc.titleCounting permutations by their runs up and down
dc.typetext

Files

Collections

arXiv