Parity of the partition function

AbstractAlthough much is known about the partition function, little is known about its parity. For the polynomials D(x):=(Dx2+1)/24, where D≡23(mod24), 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 using generalized Borcherds products, and we employ Galois representations and locally nilpotent Hecke algebras