Abstract
<div class="line" id="line-19"> 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 <i> p </i> ( <i> n </i> ), 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 <i> Mathematica </i> . I will share Rademacher-type formulas for various restricted partition functions which were obtained with the aid of the computer.</div>
| Original language | American English |
|---|---|
| State | Published - Dec 5 2008 |
| Event | Combinatory Analysis: Partitions, q-Series, and Applications - State College, PA Duration: Dec 5 2008 → … |
Conference
| Conference | Combinatory Analysis: Partitions, q-Series, and Applications |
|---|---|
| Period | 12/5/08 → … |
Keywords
- Circle method
- Computer algebra
- Rademacher-type formulae
- Restricted partition functions
DC Disciplines
- Mathematics