A combinatorial proof of the Lebesgue identity

DOI10.1016/j.disc.2007.06.003zbMath1147.05009OpenAlexW2055989099MaRDI QIDQ2427521

Amy M. Fu

Publication date: 13 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.003

zbMATH Keywords

insertion algorithmLebesgue identityalgorithm ZZeilberger

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Related Items (2)

The Algorithm Z and Ramanujan's \({}_{1} \psi _{1}\) summation ⋮ Scaling limits for the Gibbs states on distance-regular graphs with classical parameters

Cites Work

• Partition bijections, a survey
• Identities in combinatorics. III: Further aspects of ordered set sorting
• A bijection for Lebesgue's partition identity in the spirit of Sylvester

This page was built for publication: A combinatorial proof of the Lebesgue identity