• Corpus ID: 7572094

ON THE PARITY OF THE PARTITION FUNCTION

@inproceedings{Robbins1995ONTP,
  title={ON THE PARITY OF THE PARTITION FUNCTION},
  author={Neville Robbins},
  year={1995}
}
Although much is known about the partition function, little is known about its parity. For the polynomials D(x) := (Dx + 1)/24, where D ≡ 23 (mod 24), we show that there are infinitely many m (resp. n) for which p(D(m)) is even (resp. p(D(n)) is odd) if there is at least one such m (resp. n). We bound the first m and n (if any) in terms of the class number h(−D). For prime D we show that there are indeed infinitely many even values. To this end we construct new modular generating functions… 
On the counting function of sets with even partition functions
Let q be an odd positive integer and P ∈ F2[z] be of order q and such that P (0) = 1. We denote by A = A(P ) the unique set of positive integers satisfying ∑ ∞ n=0 p(A, n)z n ≡ P (z) (mod 2), where
A Combinatorial Proof on Partition Function Parity
TLDR
A new, self-contained proof of Subbarao's result is given by constructing a series of bijections and involutions, along the way getting a more general theorem concerning the enumeration of a special subset of integer partitions.
PARITY OF THE PARTITION FUNCTION AND TRACES OF SINGULAR MODULI
We prove that the parity of the partition function is given by the "trace" of the Hauptmodul for at points of complex multiplication. Using Hecke operators, we generalize this to relate the Hecke
Parity of the coefficients of Klein’s -function
Klein’s j-function is one of the most fundamental modular functions in number theory. However, not much is known about the parity of its coefficients. It is believed that the odd coefficients are
Eta-quotients and divisibility of certain partition functions by powers of primes
Andrews’ (k, i)-singular overpartition function Ck,i(n) counts the number of overpartitions of n in which no part is divisible by k and only parts ≡ ±i (mod k) may be overlined. In recent times,
A mod ℓ Atkin–Lehner theorem and applications
If f(z) is a weight $${k\in \frac{1}{2}\mathbb {Z}}$$ meromorphic modular form on Γ0(N) satisfying$$f(z)=\sum_{n\geq n_0} a_ne^{2\pi i mnz}, $$where $${m \nmid N,}$$ then f is constant. If k ≠ 0,
On Divisors, Congruences, and Symmetric Powers of Modular Forms
This thesis contains research articles on various topics in the theory of modular forms. First we investigate divisors of meromorphic modular forms of higher level using polar harmonic Maass forms of
Eulerian series, zeta functions and the arithmetic of partitions
In this Ph.D. dissertation (2018, Emory University) we prove theorems at the intersection of the additive and multiplicative branches of number theory, bringing together ideas from partition theory,
...
...

References

SHOWING 1-10 OF 54 REFERENCES
On the Distribution of Parity in the Partition Function
Kolbcrg [1] proved, but by contradiction and without identifying the arguments n, that i nitely many p(n) are even, and infinitely many are odd. His proof is almost as simple as Euclid's proof that
PERIODICITY MODULO m AND DIVISIBILITY PROPERTIES OF THE PARTITION FUNCTION(
has infinitely many solutions in non-negative integers n. This conjecture seems difficult and I have only scattered results. In ?2 of this paper it will be shown that the conjecture is true for m= 5
SOME PROPERTIES OF p(n) AND c(n) MODULO POWERS OF 13
j(^r) = E c(n)xn = (1 +240 0 u3(n)xn) /xf24(x) 744, where 03(n) = d3. dln Then p(n) is just the number of unrestricted partitions of n, and c(n) is the Fourier coefficient of Klein's modular
Congruences for the Coefficients of Modular forms and Some New Congruences for the Partition Function
  • M. Newman
  • Mathematics
    Canadian Journal of Mathematics
  • 1957
If n is a non-negative integer, define p r(n) as the coefficient of x n in ; otherwise define p r(n) as 0. In a recent paper (2) the author established the following congruence: Let r = 4, 6, 8, 10,
A simple proof of the Ramanujan conjecture for powers of 5.
Ramanujan conjectured, and G. N. Watson proved, that if n is of a specific form then p (n), the number of partitions of «, is divisible by a high power of 5. In the present note, we establish
Proof of a conjecture of Ramanujan
  • A. Atkin
  • Mathematics
    Glasgow Mathematical Journal
  • 1967
We write and so that p(n) is the number of unrestricted partitions of n. Ramanujan [1] conjectured in 1919 that if q = 5, 7, or 11, and 24m ≡ 1 (mod qn), then p(m) ≡ 0 (mod qn). He proved his
Dyson's crank of a partition
holds. He was thus led to conjecture the existence of some other partition statistic (which he called the crank); this unknown statistic should provide a combinatorial interpretation of ^-p(lln + 6)
Sieved partition functions and $q$-binomial coefficients
The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved q-binomial coefficient is the sum of those terms whose exponents are congruent to r modu!o
The Theory of Partitions
TLDR
The generating functions which occur in the theory of partitions and functions closely related to them belong to two important classes of functions, namely the theta functions and the modular functions, both of which have received much attention and have been most thoroughly investigated since the time of Jacobi.
...
...