Presented by: Alexander Dunn, University of Illinois

The problem of determining partition asymptotics has a rich history dating back to Hardy and Ramanujan in the early 20th century. In 2015 Vaughn obtained asymptotic formulas for the number of partitions of an integer into squares.  Gafni extended this to $d$th powers. Here we obtain such formulas for the number of partitions into values of an arbitrary integer polynomial $f$ subject to some mild hypotheses. Our methods use an interplay of the circle method, the polylogarithm, and the Matsumoto-Weng zeta function. This is a joint work with Nicolas Robles.

Talk based on the preprint:

About Pure mathematics seminars

We present regular seminars on a range of pure mathematics interests. Students, staff and visitors to UQ are welcome to attend, and to suggest speakers and topics.

Seminars are usually held on Tuesdays from 2 to 3pm.

Talks comprise 45 minutes of speaking time plus five minutes for questions and discussion.

Information for speakers

Researchers in all pure mathematics fields attend our seminars, so please aim your presentation at a general mathematical audience.

Contact us

To volunteer to talk or to suggest a speaker, email Ole Warnaar or Ramiro Lafuente.


Priestley Building (67)