author = {Nicolas Allen Smoot and Cristian-Silviu Radu},
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.},
journal = {Journal of Symbolic Computation},
volume = {104},
pages = {105--133},
isbn_issn = {0747-7171},
year = {2021},
refereed = {yes},
length = {29},
url = {https://doi.org/10.1016/j.jsc.2020.04.008}