author = {Cristian-Silviu Radu and Nicolas Allen Smoot},
title = {{A Method of Verifying Partition Congruences by Symbolic Computation}},
language = {english},
abstract = {Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed to efficiently check a very large number of cases of such conjectures. This allows substantial evidence to be collected for a given conjecture, before a complete proof is attempted.},
year = {2019},
note = {Submitted},
institution = {Research Institute for Symbolic Computation (RISC)},
length = {37}