Nice Bounds for the Generalized Ballot Problem

Details Nice Bounds for the Generalized Ballot Problem Nice Bounds for the Generalized Ballot Problem

2009-12-10

arxiv.org/abs/0912.1999v1

Mathematics

Combinatorics

Scientific paper

This paper gives two sharp bounds for the generalized ballot problem with
candidate A receiving at least \mu times as candidate B for an arbitrary real
number \mu.

Affiliated with

Also associated with

No associations

Rating

Nice Bounds for the Generalized Ballot Problem 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 Nice Bounds for the Generalized Ballot Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nice Bounds for the Generalized Ballot Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595305