Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Parity distribution and divisibility of Mex-related partition functions (2303.03647v1)

Published 7 Mar 2023 in math.NT

Abstract: Andrews and Newman introduced the mex-function $\text{mex}{A,a}(\lambda)$ for an integer partition $\lambda$ of a positive integer $n$ as the smallest positive integer congruent to $a$ modulo $A$ that is not a part of $\lambda$. They then defined $p{A,a}(n)$ to be the number of partitions $\lambda$ of $n$ satisfying $\text{mex}{A,a}(\lambda)\equiv a\pmod{2A}$. They found the generating function for $p{t,t}(n)$ and $p_{2t,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 $p_{mt,t}(n)$ for all positive integers $m$ and $t$. We show that for sufficiently large $X$, the number of all positive integer $n\leq X$ such that $p_{mt,t}(n)$ is an even number is at least $\mathcal{O}(\sqrt{X/3})$ for all positive integers $m$ and $t$. We also prove that for sufficiently large $X$, the number of all positive integer $n\leq X$ such that $p_{mp,p}(n)$ is an odd number is at least $\mathcal{O}(\log \log X)$ for all $m\not \equiv 0\pmod{3}$ and all primes $p\equiv 1\pmod{3}$. Finally, we establish identities connecting the ordinary partition function to $p_{mt,t}(n)$.

Summary

We haven't generated a summary for this paper yet.