Random Walk in a Weyl Chamber
Open Access
- 1 May 1992
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 115 (1) , 27-31
- https://doi.org/10.2307/2159560
Abstract
The classical Ballot problem that counts the number of ways of walking from the origin and staying within the wedge <!-- MATH ${x_1} \geq {x_2} \geq \cdots \geq {x_n}$ --> (which is a Weyl chamber for the symmetric group), using positive unit steps, is generalized to general Weyl groups and general sets of steps.
Keywords
This publication has 15 references indexed in Scilit:
- q-generalization of a ballot problemDiscrete Mathematics, 1994
- Reflection and algorithm proofs of some more lie group dual pair identitiesJournal of Combinatorial Theory, Series A, 1993
- Enumeration of lattice paths and generating functions for skew plane partitionsmanuscripta mathematica, 1989
- Some applications of hypergeometric shift operatorsInventiones Mathematicae, 1989
- On an inclusion-exclusion formula based on the reflection principleDiscrete Mathematics, 1987
- A new method for solving a class of ballot problemsJournal of Combinatorial Theory, Series A, 1985
- Commensurate melting, domain walls, and dislocationsPhysical Review B, 1984
- Andre's reflection proof generalized to the many-candidate ballot problemDiscrete Mathematics, 1983
- Some Conjectures for Root SystemsSIAM Journal on Mathematical Analysis, 1982
- Discrete Groups Generated by ReflectionsAnnals of Mathematics, 1934