Four Proofs of the Ballot Theorem

DOI10.1080/0025570X.2007.11953509zbMath1144.05303OpenAlexW2134788705MaRDI QIDQ3526245

No author found.

Publication date: 25 September 2008

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0025570x.2007.11953509

zbMATH Keywords

inductioncycle lemmaballot problemuniform partitionvotesbad Ballot permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Voting theory (91B12)

Related Items (13)

Raney numbers, threshold sequences and Motzkin-like paths ⋮ Crossing numbers of random two-bridge knots ⋮ On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue ⋮ A model problem for multiplicative chaos in number theory ⋮ On distribution of the leadership time in counting votes and predicting winners ⋮ A further study of some Markovian Bitcoin models from Göbel et al. ⋮ Bertrand's ballot theorem ⋮ Constructing MSTD sets using bidirectional ballot sequences ⋮ A history and a survey of lattice path enumeration ⋮ Homomesy in products of two chains ⋮ Generating 2-Gray codes for ballot sequences in constant amortized time ⋮ Explicit transient probabilities of various Markov models ⋮ Raney distributions and random matrix theory

This page was built for publication: Four Proofs of the Ballot Theorem