Two New Bijections on Lattice Paths

Details Two New Bijections on Lattice Paths Two New Bijections on Lattice Paths

2006-09-07

arxiv.org/abs/math/0609222v1

Mathematics

Combinatorics

Scientific paper

Suppose 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.

Affiliated with

Also associated with

No associations

Rating

Two New Bijections on Lattice Paths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two New Bijections on Lattice Paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two New Bijections on Lattice Paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112647