Papers
Topics
Authors
Recent
Search
2000 character limit reached

Newman's conjecture for the partition function modulo integers with at least two distinct prime divisors

Published 1 Dec 2022 in math.NT | (2212.00636v2)

Abstract: Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that [ p(n)\equiv r \pmod{M}. ] For a positive integer $d$, let $B_{d}$ be the set of positive integers $M$ such that the number of prime divisors of $M$ is $d$. In this paper, we prove that for each positive integer $d$, the density of the set of positive integers $M$ for which Newman's Conjecture holds in $B_{d}$ is $1$. Furthermore, we study an analogue of Newman's Conjecture for weakly holomorphic modular forms on $\Gamma_0(N)$ with nebentypus, and this applies to $t$-core partitions and generalized Frobenius partitions with $h$-colors.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.