A combinatorial proof of an identity for the divisor generating function

2012/01/20 by Ando, Masanori
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1201.4216

Abstract

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

Related

• Demystifying a divisibility property of the Kostant partition function
• A Four-parameter Partition Identity
• On the kth smallest part of a partition into distinct parts
• On the fractal nature of the partition function p(n) and the divisor functions d_i(n)
• Bressoud-Subbarao type weighted partition identities for a generalized divisor function