Short proofs of Saalschütz's and Dixon's theorems

DOI10.1016/0097-3165(85)90026-3zbMath0559.05008OpenAlexW2092886068MaRDI QIDQ802560

Ira M. Gessel, Dennis W. Stanton

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(85)90026-3

zbMATH Keywords

binomial coefficients

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Related Items (15)

Telescoping partial fractions decompositions, the little \(q\)-Jacobi functions of complex order, and the nonterminating \(q\)-Saalschütz sum ⋮ Binomial identities -- combinatorial and algorithmic aspects ⋮ A Generalization of the Pfaff-Saalschütz Theorem ⋮ A combinatorial proof of the multivariable Lagrange inversion formula ⋮ Generalization of some hypergeometric functions ⋮ A new proof of the $q$-Dixon identity ⋮ Generalization of a Hadamard type inequality for permanents ⋮ A simple proof of Dixon's identity ⋮ Central Values for Clebsch–Gordan Coefficients ⋮ Pfaff-Saalschütz revisited ⋮ Lagrange inversion ⋮ A class of Baker-Akhiezer arrangements ⋮ A short proof of the \(q\)-Dixon identity ⋮ Unnamed Item ⋮ An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities

Cites Work

• Unnamed Item
• Combinatorial problems of commutation and rearrangements
• Coefficients in Expansions of Certain Rational Functions

This page was built for publication: Short proofs of Saalschütz's and Dixon's theorems