A method of verifying partition congruences by symbolic computation. (May 2021)

• Record Type: Journal Article
• Authors: Radu, Cristian-Silviu; Smoot, Nicolas Allen
• Is Part Of: Journal of symbolic computation. Volume 104(2021)
• Page Start: 105
• Page End: 133
• Publication Date: 2021-05
• Subjects: Partition congruences -- Modular functions -- Number theoretic algorithm; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2020.04.008
• Languages: English
• ISSNs: 0747-7171

Abstract

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.