The following pages link to Four Proofs of the Ballot Theorem (Q3526245):
Displaying 13 items.
- Bertrand's ballot theorem (Q502696) (← links)
- On distribution of the leadership time in counting votes and predicting winners (Q900541) (← links)
- Constructing MSTD sets using bidirectional ballot sequences (Q971849) (← links)
- A history and a survey of lattice path enumeration (Q972828) (← links)
- Crossing numbers of random two-bridge knots (Q1663861) (← links)
- Generating 2-Gray codes for ballot sequences in constant amortized time (Q2092396) (← links)
- Raney numbers, threshold sequences and Motzkin-like paths (Q2166306) (← links)
- 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 (Q2176360) (← links)
- Raney distributions and random matrix theory (Q2352406) (← links)
- Homomesy in products of two chains (Q2517651) (← links)
- A model problem for multiplicative chaos in number theory (Q2674713) (← links)
- A further study of some Markovian Bitcoin models from Göbel et al. (Q3295897) (← links)
- Explicit transient probabilities of various Markov models (Q5024703) (← links)
