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

preprint2022arXivOpen access

Abstract

We continue the study of the (a,b,m)(a,b,m)-copartition function cpa,b,m(n)\mathrm{cp}_{a,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)\mathrm{cp}_{a,b,m}(n) has a nice representation as an infinite product. In this paper, we focus on the parity of cpa,b,m(n)\mathrm{cp}_{a,b,m}(n). As with the ordinary partition function, it is difficult to show positive density of either even or odd values of cpa,b,m(n)\mathrm{cp}_{a,b,m}(n) for arbitrary a,ba, b, and mm. However, we find specific cases of a,b,ma,b,m such that cpa,b,m(n)\mathrm{cp}_{a,b,m}(n) is even with density 1. Additionally, we show that the sequence {cpa,m−a,m(n)}n=0∞\{\mathrm{cp}_{a,m-a,m}(n)\}_{n=0}^\infty takes both even and odd values infinitely often.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.