Enumeration of lattice paths and generating functions for skew plane partitions

DOI10.1007/BF01168868zbMath0672.05011OpenAlexW2028385702MaRDI QIDQ1119583

Christian Krattenthaler

Publication date: 1989

Published in: Manuscripta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/155373

zbMATH Keywords

generating functionslattice pathsskew plane partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Determinants, permanents, traces, other special matrix functions (15A15)

Related Items

Counting quadrant walks via Tutte's invariant method ⋮ On the Okounkov-Olshanski formula for standard tableaux of skew shapes ⋮ Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths ⋮ A history and a survey of lattice path enumeration ⋮ Random Walk in a Weyl Chamber ⋮ Generating functions for plane partitions of a given shape ⋮ On the Okounkov-Olshanski formula for standard tableaux of skew shapes ⋮ \(q\)-generalization of a ballot problem

Cites Work

• Unnamed Item
• Unnamed Item
• Binomial determinants, paths, and hook length formulae
• q-Catalan numbers
• The Hillman-Grassl correspondence and the enumeration of reverse plane partitions
• Reverse plane partitions and tableau hook numbers
• On an inclusion-exclusion formula based on the reflection principle
• Andre's reflection proof generalized to the many-candidate ballot problem
• A bijective proof of the generating function for the number of reverse plane partitions via lattice paths
• A bijective proof of the hook-length formula
• Ordered structures and partitions