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

Institut für Symbolisches Rechnen

Publikation: Beitrag in Fachzeitschrift › Artikel › Begutachtung

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.

Originalsprache	Englisch
Seiten (von - bis)	105-133
Seitenumfang	29
Fachzeitschrift	Journal of Symbolic Computation
Volume	104
DOIs	https://doi.org/10.1016/j.jsc.2020.04.008
Publikationsstatus	Veröffentlicht - 01 Mai 2021

Wissenschaftszweige

101 Mathematik
101001 Algebra
101005 Computeralgebra
101009 Geometrie
101012 Kombinatorik
101013 Mathematische Logik
101020 Technische Mathematik

JKU-Schwerpunkte

Digital Transformation

Zugriff auf Dokument

10.1016/j.jsc.2020.04.008

Andere Dateien und Links

Verknüpfung zur Publikation in Scopus

Dieses zitieren

@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",

month = may,

day = "1",

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/5/1

Y1 - 2021/5/1

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.

UR - https://www.scopus.com/pages/publications/85085639404

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 -