A combinatorial proof of the Lebesgue identity
暂无分享,去创建一个
We present a combinatorial proof of the Lebesgue identity based on the insertion algorithm of Zeilberger.
[1] George E. Andrews,et al. Identities in combinatorics III: Further aspects of ordered set sorting , 1984, Discret. Math..
[2] Igor Pak,et al. Partition bijections, a survey , 2006 .
[3] Christine Bessenrodt,et al. A bijection for Lebesgue's partition identity in the spirit of Sylvester , 1994, Discret. Math..