PED and POD partitions: combinatorial proofs of recurrence relations
Preprint
Abstract
PED partitions are partitions with even parts distinct while odd parts are unrestricted. Similarly, POD partitions have distinct odd parts while even parts are unrestricted. Merca proved several recurrence relations analytically for the number of PED partitions of $n$. They are similar to the recurrence relation for the number of partitions of $n$ given by Euler's pentagonal number theorem. We provide combinatorial proofs for all of these theorems and also for the pentagonal number theorem for PED partitions proved analytically by Fink, Guy, and Krusemeyer. Moreover, we prove combinatorially a recurrence for POD partitions given by Ballantine and Merca, Beck-type identities involving PED and POD partitions, and several other results about PED and POD partitions.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- 4-regular partitions and the pod functionQuaestiones Mathematicae, 2023
- Combinatorial proof of the minimal excludant theoremInternational Journal of Number Theory, 2021
- On certain unimodal sequences and strict partitionsDiscrete Mathematics, 2020
- New relations for the number of partitions with distinct even partsJournal of Number Theory, 2017
- A combinatorial proof of Jacobi’s triple product identityThe Ramanujan Journal, 2017
- Partitions with parts occurring at most thriceContributions to Discrete Mathematics, 2008
- Combinatorial proof of a theorem on partitions into an even or odd number of partsJournal of Combinatorial Theory, Series A, 1976
- Two theorems of Gauss and allied identities proved arithmeticallyPacific Journal of Mathematics, 1972