Silviu Radu, Nicolas Smoot,
"A Method of Verifying Partition Cungruences by Symbolic Computation"
, in Journal of Symbolic Computation, Vol. 104, to appear, Seite(n) 105-133, 2021, ISSN: 1095-855X
Original Titel:
A Method of Verifying Partition Cungruences by Symbolic Computation
Sprache des Titels:
Englisch
Original Kurzfassung:
Conjectures involving infinite families of restricted partition congruences can be diffcult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modifed 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.