Computer-assisted proofs of congruences for multipartitions and divisor function convolutions, based on methods of differential algebra

Abstract

This paper provides elementary proofs for several types of congruences involving multipartitions and self-convolutions of the divisor function. Our computations use differential algebra and Gröbner bases, and employ a couple of MAPLE programs available as ancillary files on arXiv. The first results of the paper are Ramanujan-type congruences of the form \(p^{*k}(qn+r) \equiv _q 0\) and \(\sigma ^{*k}(qn+r) \equiv _q 0\), where p(n) and \(\sigma (n)\) are the partition and divisor functions, \(q > 3\) is prime, \(\equiv _q\) denotes congruence modulo q, and \(^{*k}\) denotes kth-order self-convolution. We prove all the valid congruences of this form for \(q \in \{5, 7, 11\}\), including the three famous partition congruences of Ramanujan, and an exceptional one for \(q = 17\). All such multipartition congruences have already been settled in principle (up to a numerical verification) due to Eichhorn and Ono, using modular forms. On the other hand, the majority of the divisor function congruences are new results. We then proceed to search for more general congruences modulo small primes, concerning linear combinations of \(\sigma ^{*k}(qn+r)\) for different values of k, as well as weighted convolutions of p(n) and \(\sigma (n)\) with polynomial weights. The paper ends with a few corollaries and extensions for the divisor function congruences, including proofs for three conjectures of N.C. Bonciocat.