The ballot problem with three candidates

DOI10.1016/S0195-6698(83)80046-8zbMath0528.05003MaRDI QIDQ786814

Heinrich Niederhausen

Publication date: 1983

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

ballot problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

A probabilistic method for lattice path enumeration ⋮ Walks confined in a quadrant are not always D-finite ⋮ Bijective counting of Kreweras walks and loopless triangulations ⋮ Walks in the quarter plane: Kreweras' algebraic model ⋮ Promotion of Kreweras words ⋮ Square lattice walks avoiding a quadrant ⋮ Promotion of Kreweras words ⋮ Generating 2-Gray codes for ballot sequences in constant amortized time ⋮ Infinite system of random walkers: winners and losers

Cites Work

• Unnamed Item
• Linear recurrences under side conditions
• Solution of an enumerative problem connected with lattice paths
• Ordered structures and partitions