Parity distribution and divisibility of Mex-related partition functions
Abstract
Andrews and Newman introduced the mex-function mexA,a(λ) for an integer partition λ of a positive integer n as the smallest positive integer congruent to a modulo A that is not a part of λ. They then defined pA,a(n) to be the number of partitions λ of n satisfying mexA,a(λ) a2A. They found the generating function for pt,t(n) and p2t,t(n) for any positive integer t, and studied their arithmetic properties for some small values of t. In this article, we study the partition function pmt,t(n) for all positive integers m and t. We show that for sufficiently large X, the number of all positive integer n≤ X such that pmt,t(n) is an even number is at least O(X/3) for all positive integers m and t. We also prove that for sufficiently large X, the number of all positive integer n≤ X such that pmp,p(n) is an odd number is at least O( X) for all m 03 and all primes p 13. Finally, we establish identities connecting the ordinary partition function to pmt,t(n).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.