8 search results - page 2 / 2 » Partition Identities and a Theorem of Zagier |
COMBINATORICS
2004
13 years 7 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
JCT
2007
13 years 7 months ago
2007
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 part...
ARSCOM
2007
13 years 7 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...