\(q\)-generalization of a ballot problem

DOI10.1016/0012-365X(94)90264-XzbMath0790.60014OpenAlexW1985791856MaRDI QIDQ1318807

Sri Gopal Mohanty, Christian Krattenthaler

Publication date: 4 April 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90264-x

zbMATH Keywords

lattice pathsballot problemnumber of elections in a specific ballot problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Related Items

Takács' asymptotic theorem and its applications: a survey, Random Walk in a Weyl Chamber, Random walk in an alcove of an affine Weyl group, and non-colliding random walks on an interval

Cites Work

• A new method for solving a class of ballot problems
• Enumeration of lattice paths and generating functions for skew plane partitions
• Andre's reflection proof generalized to the many-candidate ballot problem
• Random Walk in a Weyl Chamber
• On the Geometry of Numbers in Elementary Number Theory