A Method of Verifying Partition Cungruences by Symbolic Computation

Silviu Radu; Nicolas Smoot

doi:10.1016/j.jsc.2020.04.008

A Method of Verifying Partition Cungruences by Symbolic Computation

Silviu Radu, Nicolas Smoot

Research Institute for Symbolic Computation

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	105-133
Number of pages	29
Journal	Journal of Symbolic Computation
Volume	104
DOIs	https://doi.org/10.1016/j.jsc.2020.04.008
Publication status	Published - 2021

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

JKU Focus areas

Digital Transformation

Access to Document

10.1016/j.jsc.2020.04.008

Cite this

@article{97ce3f8782dd4bfbab9fd458fa771bc8,

title = "A Method of Verifying Partition Cungruences by Symbolic Computation",

abstract = "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.",

author = "Silviu Radu and Nicolas Smoot",

year = "2021",

doi = "10.1016/j.jsc.2020.04.008",

language = "English",

volume = "104",

pages = "105--133",

journal = "Journal of Symbolic Computation",

issn = "1095-855X",

publisher = "Elsevier BV",

}

TY - JOUR

T1 - A Method of Verifying Partition Cungruences by Symbolic Computation

AU - Radu, Silviu

AU - Smoot, Nicolas

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

U2 - 10.1016/j.jsc.2020.04.008

DO - 10.1016/j.jsc.2020.04.008

M3 - Article

SN - 1095-855X

VL - 104

SP - 105

EP - 133

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

ER -