Enumeration of lattice paths and generating functions for skew plane partitions
- 1 June 1989
- journal article
- Published by Springer Nature in manuscripta mathematica
- Vol. 63 (2) , 129-155
- https://doi.org/10.1007/bf01168868
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On an inclusion-exclusion formula based on the reflection principleDiscrete Mathematics, 1987
- Binomial determinants, paths, and hook length formulaeAdvances in Mathematics, 1985
- q-Catalan numbersJournal of Combinatorial Theory, Series A, 1985
- A bijective proof of the generating function for the number of reverse plane partitions via lattice pathsLinear and Multilinear Algebra, 1984
- Andre's reflection proof generalized to the many-candidate ballot problemDiscrete Mathematics, 1983
- A bijective proof of the hook-length formulaJournal of Algorithms, 1982
- The Hillman-Grassl correspondence and the enumeration of reverse plane partitionsJournal of Combinatorial Theory, Series A, 1981
- Reverse plane partitions and tableau hook numbersJournal of Combinatorial Theory, Series A, 1976
- Ordered structures and partitionsMemoirs of the American Mathematical Society, 1972
- Theory and Application of Plane Partitions: Part 1Studies in Applied Mathematics, 1971