Andrew Sills

Affiliation: Georgia Southern University


Title Of Talk: Rademacher's infinite partial fractions conjecture is (almost certainly) false


Abstract: This is joint work with Doron Zeilberger. Let $p_m(n)$ denote the number of partitions of $n$ with at most $m$ summands. The generating function of $p_m(n)$ is $$ f_m(x) = \sum_{n\geq 0} p_m(n) x^n= \frac{1}{(1-x)(1-x^2)\cdots(1-x^m)}. $$ For any fixed $m$, it is theoretically straightforward to find the partial fraction decomposition of the generating function for $p_m(n).$ Rademacher made a beautiful and natural conjecture concerning the limiting behavior of the coefficients in the partial fraction decomposition of $f_m(x)$ as $m\rightarrow\infty$, which was published posthumously in 1973. Little progress had been made on this conjecture until just recently, perhaps in large part due to the difficulty of actually calculating Rademacher's coefficients for even moderately large values of $m.$ Zeilberger and I found and implemented a fast algorithm for computing Rademacher's coefficients, and as a result of the data we collected, it now seems quite clear that Rademacher's conjecture must be FALSE! We present some new theorems and conjectures concerning the behavior of Rademacher's coefficients.

WARNING: This page contains MATH-JAX

Last update made Tue Oct 23 09:16:49 EDT 2012.
Please report problems to: