The ballot problem with three candidates

DOI10.1016/S0195-6698(83)80046-8MaRDI QIDQ786814zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3693278 (Why is no real title available?)
• Linear recurrences under side conditions
• Ordered structures and partitions
• Solution of an enumerative problem connected with lattice paths

Cited in

(10)

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

This page was built for publication: The ballot problem with three candidates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786814)