arXiv Analytics

Sign in

arXiv:math/0510121 [math.CO]AbstractReferencesReviewsResources

Weighted Forms of Euler's Theorem

William Y. C. Chen, Kathy Q. Ji

Published 2005-10-06Version 1

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by the insight of Andrews on the connection between Ramanujan's identities and Euler's theorem. Our combinatorial formulations of Ramanujan's identities rely on the notion of rooted partitions. Iterated Dyson's map and Sylvester's bijection are the main ingredients in the weighted forms of Euler's theorem.

Related articles: Most relevant | Search more
arXiv:1111.1489 [math.CO] (Published 2011-11-07, updated 2012-08-22)
Euler's Partition Theorem with Upper Bounds on Multiplicities
arXiv:2111.13988 [math.CO] (Published 2021-11-27, updated 2022-03-30)
A Proof of Euler's Theorem via Quandles
arXiv:1902.00228 [math.CO] (Published 2019-02-01)
A lecture hall theorem for $m$-falling partitions