Related papers: The partition function modulo 4
We study the index of nilpotency relative to certain Hecke operators in spaces of modular forms with integer weight and level $N$ with integer coefficients modulo primes $p$ for $(p, N) \in \{(3, 1), (5, 1), (7, 1), (3, 4)\}$. In these…
We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $\phi(n)$ and the sum-of-proper-divisors function $s(n):=\sigma(n)-n$. We prove that the values $\phi(n)$, for $n\le x$, that are coprime to $p$…
For a sequence $M=(m_{i})_{i=0}^{\infty}$ of integers such that $m_{0}=1$, $m_{i}\geq 2$ for $i\geq 1$, let $p_{M}(n)$ denote the number of partitions of $n$ into parts of the form $m_{0}m_{1}\cdots m_{r}$. In this paper we show that for…
New congruences are found for Andrews' smallest parts partition function spt(n). The generating function for spt(n) is related to the holomorphic part alpha(24z) of a certain weak Maass form M(z) of weight 3/2. We show that a normalized…
Folsom, Kent, and Ono used the theory of modular forms modulo $\ell$ to establish remarkable ``self-similarity'' properties of the partition function and give an overarching explanation of many partition congruences. We generalize their…
Let $p$ be a prime for which the congruence group $\Gamma_0(p)^*$ is of genus zero, and $j_p^*$ be the corresponding Hauptmodul. Let $f$ be a nearly holomorphic modular form of weight 1/2 on $\Gamma_0(4p)$ which satisfies some congruence…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. Motivated by some recent conjectures of Keith and Zanello, we establish infinite families of congruences modulo $2$…
In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…
In this Ph.D dissertation (University of Virginia, 2022), we prove results about the coefficients of partition-theoretic generating functions and of coefficients of integer weight modular forms. Using various forms of the circle method, we…
For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We…
Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…
Using Zeilberger's algorithm, we here give a proof of the supercongruence $$ \sum_{n=0}^{\frac{p^r-3}{4}}(8n+1)\frac{\left(\frac{1}{4}\right)_n^4}{(1)_n^4}\equiv -p^3…
We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…
Let $P_{r}$ denote an integer with at most $r$ prime factors counted with multiplicity. In this paper we prove that for some $\lambda < \frac{1}{12}$, the inequality $\{\sqrt{p}\}<p^{-\lambda}$ has infinitely many solutions in primes $p$…
We investigate integrality and divisibility properties of Fourier coefficients of meromorphic modular forms of weight $2k$ associated to positive definite integral binary quadratic forms. For example, we show that if there are no…
Concave compositions are ordered partitions whose parts are decreasing towards a central part. We study the distribution modulo $a$ of the number of concave compositions. Let $c(n)$ be the number of concave compositions of $n$ having even…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…