A new method for solving a class of ballot problems

DOI10.1016/0097-3165(85)90085-8zbMath0579.05005OpenAlexW1992445842MaRDI QIDQ1066902

Michael Filaseta

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90085-8

zbMATH Keywords

determinantballot problemk-candidate generalization

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

The Ballot Problem Revisited ⋮ Lattice path counting and the theory of queues ⋮ Random Walk in a Weyl Chamber ⋮ Random walk in an alcove of an affine Weyl group, and non-colliding random walks on an interval ⋮ \(q\)-generalization of a ballot problem

Cites Work

• Coincidence probabilities
• A problem of arrangements
• A Three-Sample Kolmogorov-Smirnov Test
• Some Aspects of the Random Sequence
• A combinatorial problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item