solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看3099次
Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem. (arXiv:1801.06815v2 [math.CO] UPDATED)
来源于:arXiv
In a recent work, Andrews gave analytic proofs of two conjectures concerning
some variations of two combinatorial identities between partitions of a
positive integer into odd parts and partitions into distinct parts discovered
by Beck. Subsequently, using the same method as Andrews, Chern presented the
analytic proof of another Beck's conjecture relating the gap-free partitions
and distinct partitions with odd length. However, the combinatorial
interpretations of these conjectures are still unclear and required. In this
paper, motivated by Glaisher's bijection, we give the combinatorial proofs of
these three conjectures directly or by proving more generalized results. 查看全文>>