Computer Algebra and Rademacher-Type Partition Formulas

Document Type

Presentation

Presentation Date

12-5-2008

Abstract or Description

One of the most impressive and useful contributions to twentieth century number theory was the circle method of Ramanujan, Hardy, and Littlewood, with subsequent improvements by Rademacher. The application of the circle method to the problem of finding a convergent series representation for p(n), the number of partitions of n involves a number of nontrivial calculations and delicate estimates, some of which are amenable to automation in a computer algebra system such as Mathematica. I will share Rademacher-type formulas for various restricted partition functions which were obtained with the aid of the computer.

Sponsorship/Conference/Institution

Combinatory Analysis: Partitions, q-Series, and Applications

Location

State College, PA

Link to Full Text

Share

COinS