Towards an Automation of the Circle Method

Andrew Sills

doi:10.1090/conm/517/10150

Towards an Automation of the Circle Method

Andrew Sills

Mathematical Sciences

Research output: Contribution to book or proceeding › Chapter

1 Downloads (Pure)

Abstract

<div class="line" id="line-19"> The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of <i> n </i> is reviewed. Next, the steps for &filig;nding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of <i> Mathematica </i> are presented along with results of a test for their numerical accuracy.</div>

Original language	American English
Title of host publication	Gems in Experimental Mathematics in Contemporary Mathematics
DOIs	https://doi.org/10.1090/conm/517/10150
State	Published - Jan 1 2010

Keywords

Automation
Circle method

DC Disciplines

Mathematics

Access to Document

10.1090/conm/517/10150License: Unspecified

fulltext.pdfFinal published version, 238 KBLicense: Unspecified

Cite this

@inbook{00a3c2ce1cf44cd5b208cc90641fc782,

title = "Towards an Automation of the Circle Method",

abstract = " The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for &filig;nding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are presented along with results of a test for their numerical accuracy.",

keywords = "Automation, Circle method",

author = "Andrew Sills",

year = "2010",

month = jan,

day = "1",

doi = "10.1090/conm/517/10150",

language = "American English",

booktitle = "Gems in Experimental Mathematics in Contemporary Mathematics",

}

TY - CHAP

T1 - Towards an Automation of the Circle Method

AU - Sills, Andrew

PY - 2010/1/1

Y1 - 2010/1/1

N2 - The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for &filig;nding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are presented along with results of a test for their numerical accuracy.

AB - The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for &filig;nding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are presented along with results of a test for their numerical accuracy.

KW - Automation

KW - Circle method

U2 - 10.1090/conm/517/10150

DO - 10.1090/conm/517/10150

M3 - Chapter

BT - Gems in Experimental Mathematics in Contemporary Mathematics

ER -

Towards an Automation of the Circle Method

Abstract

Keywords

DC Disciplines

Access to Document

Fingerprint

Cite this