Refinements of Beck-type partition identities

Abstract

Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement of Franklin's identity when $j=1$. We prove Franklin's identity when $j=1$, $r=2$ for partitions with fixed perimeter, i.e., fixed largest hook. We also derive a Beck-type identity for partitions with fixed perimeter: the excess in the number of parts in all partitions into odd parts with perimeter $M$ over the number of parts in all partitions into distinct parts with perimeter $M$ equals the number of partitions with perimeter $M$ whose set of even parts is a singleton. We provide analytic and combinatorial proofs of our results.

14 pages