English

On generalizations of theorems of MacMahon and Subbarao

Combinatorics 2022-01-20 v3

Abstract

In this paper, we consider various theorems of P.A. MacMahon and M.V. Subbarao. For a non-negative integer nn, MacMahon proved that the number of partitions of nn wherein parts have multiplicity greater than 1 is equal to the number of partitions of nn in which odd parts are congruent to 3 modulo 6. We give a new bijective proof for this theorem and its generalization, which consequently provides a new proof of Andrews' extension of the theorem. We also generalize Subbarao's finitization of Andrews' extension. This generalization is based on Glaisher's extension of Euler's mapping for odd-distinct partitions and as a result, a bijection given by Sellers and Fu is also extended. Unlike in the case of Sellers and Fu where two residue classes are fixed, ours takes into consideration all possible residue classes. Furthermore, some arithmetic properties of related partition functions are derived

Keywords

Cite

@article{arxiv.2201.03015,
  title  = {On generalizations of theorems of MacMahon and Subbarao},
  author = {Darlison Nyirenda and Beaullah Mugwangwavari},
  journal= {arXiv preprint arXiv:2201.03015},
  year   = {2022}
}