Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics

DOI10.1016/0012-365X(80)90173-9zbMath0447.05012MaRDI QIDQ1146185

Doron Zeilberger

Publication date: 1980

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

zbMATH Keywords

generating functionsplane partitionspartial difference equationslattice walkBallot problemSimon Newcomb's problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Additive difference equations (39A10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items

Cube group invariant spherical harmonics and Krawtchouk polynomials, Denert's Permutation Statistic Is Indeed Euler‐Mahonian

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lattice walk approach to the inv and maj q-counting of multiset permutations
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Some Aspects of the Random Sequence
• Rectangular arrays and plane partitions
• Theory and Application of Plane Partitions. Part 2