Two New Bijections on Lattice Paths

Simple item page
dc.creatorHurlbert, Glenn
dc.creatorKamat, Vikram
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:38Z
dc.date.available2026-07-07T07:24:38Z
dc.descriptionSuppose 2n voters vote sequentially for one of two candidates. For how many such sequences does one candidate have strictly more votes than the other at each stage of the voting? The answer is \binom{2n}{n} and, while easy enough to prove using generating functions, for example, only two combinatorial proofs exist, due to Kleitman and Gessel. In this paper we present two new (far simpler) bijective proofs.
dc.identifierhttps://arxiv.org/abs/math/0609222
dc.identifierhttp://arxiv.org/abs/math/0609222
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116434
dc.subjectCombinatorics
dc.subject05A15
dc.titleTwo New Bijections on Lattice Paths
dc.typetext

Files

Collections

arXiv