Nice Bounds for the Generalized Ballot Problem
Abstract
This paper gives two sharp bounds for the generalized ballot problem with candidate A receiving at least μ times as candidate B for an arbitrary real number μ.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.