On -regular partitions and Hickerson's identity
Abstract
Based on two involutions and a bijection, we completely determine the difference between the number of -regular partitions of n into an even number of parts and into an odd number of parts for all positive integers n and >1, which extends two recent results due to Ballantine and Merca. As an application, we provide a combinatorial proof of Hickerson's identity on the number of partitions into an even and odd number of parts.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.