Andre's reflection proof generalized to the many-candidate ballot problem
From MaRDI portal
Cites work
Cited in
(25)- Enumeration of lattice paths and generating functions for skew plane partitions
- Higher dimensional restricted lattice paths with diagonal steps
- Reflection and algorithm proofs of some more Lie group dual pair identities
- On the product of a Schur function and a skew Schur function
- \(q\)-generalization of a ballot problem
- Random walk in an alcove of an affine Weyl group, and non-colliding random walks on an interval
- Invariants of the Brill-Noether curve
- Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets
- On an inclusion-exclusion formula based on the reflection principle
- Large deviation principle for moment map estimation
- A new statistic on Dyck paths for counting 3-dimensional Catalan words
- The asymptotics of reflectable weighted walks in arbitrary dimension
- Generating functions for plane partitions of a given shape
- Large deviations and one-sided scaling limit of randomized multicolor box-ball system
- Random walks in octants, and related structures
- Three dimensional Narayana and Schröder numbers
- Current trends in asymptotics: Some problems and some solutions
- Random Walk in a Weyl Chamber
- Higher dimensional lattice walks: connecting combinatorial and analytic behavior
- MacMahon's master theorem, representation theory, and moments of Wishart distributions
- Experimenting with standard Young tableaux
- The asymptotics of reflectable weighted walks in arbitrary dimension
- Random walks in Weyl chambers and the decomposition of tensor powers
- Multivariate Fuss-Catalan numbers
- Determinant formulas relating to tableaux of bounded height
This page was built for publication: Andre's reflection proof generalized to the many-candidate ballot problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837684)
