On the parity of the number of (a, b, m)-copartitions of n

Hannah E. Burson, Dennis Eichhorn

Research output: Contribution to journalArticlepeer-review

Abstract

We continue the study of the (a,b,m)-copartition function cpa,b,m(n), which arose as a combinatorial generalization of Andrews' partitions with even parts below odd parts. The generating function of cpa,b,m(n) has a nice representation as an infinite product. In this paper, we focus on the parity of cpa,b,m(n). We find specific cases of a,b,m such that cpa,b,m(n) is even with density 1. Additionally, we show that the sequence {cpa,m-a,m(n)}n=0∞ takes both even and odd values infinitely often.

Original languageEnglish (US)
Pages (from-to)2241-2254
Number of pages14
JournalInternational Journal of Number Theory
Volume19
Issue number9
DOIs
StatePublished - Oct 1 2023

Bibliographical note

Publisher Copyright:
© 2023 World Scientific Publishing Company.

Keywords

  • Copartitions
  • parity
  • partitions
  • q -series

Fingerprint

Dive into the research topics of 'On the parity of the number of (a, b, m)-copartitions of n'. Together they form a unique fingerprint.

Cite this