On 1/20/2011 2:29 PM, Robert Munafo wrote:
I was able to download two relevant papers from here:
Folsom-Kent-Ono paper is 17 pages, Bruner-Ono paper is 3 pages. Based on the abstracts (below) I think the former is the result described in the recent news story.
I just attended Ono's talk kicking off a weekend conference at Emory University on the number theory of partitions. It was a general audience talk, so he didn't give any technical details beyond what was in two abstracts that were quoted in the previous message. He was in fact talking about the results in both papers; the one with Bruinier was given top billing. The most striking thing for me was the claim that their new formula for p(n) is more efficient for calculation than existing methods; Ono suggested that it should be implemented in Sage and the like. Their paper is so short at the moment because it contains only a statement of their results; Ono said it will include the proofs as soon as he's satisfied with how they've been written up. The talk did a good job of entertaining a mixed audience, even including a picture of the Count from Sesame Street. The experts here for the conference seemed to be impressed. A few of them got the rest of the overflow audience to rise for a standing ovation at the end, something I don't recall seeing at a math talk before. -- Fred W. Helenius fredh@ix.netcom.com