English

Partition Polynomials: Asymptotics and Zeros

Combinatorics 2007-11-12 v1 Number Theory

Abstract

Let Fn(x)F_n(x) be the partition polynomial k=1npk(n)xk\sum_{k=1}^n p_k(n) x^k where pk(n)p_k(n) is the number of partitions of nn with kk parts. We emphasize the computational experiments using degrees up to 70,00070,000 to discover the asymptotics of these polynomials. Surprisingly, the asymptotics of Fn(x)F_n(x) have two scales of orders nn and n\sqrt{n} and in three different regimes inside the unit disk. Consequently, the zeros converge to network of curves inside the unit disk given in terms of the dilogarithm.

Keywords

Cite

@article{arxiv.0711.1373,
  title  = {Partition Polynomials: Asymptotics and Zeros},
  author = {Robert P. Boyer and William M. Y. Goh},
  journal= {arXiv preprint arXiv:0711.1373},
  year   = {2007}
}
R2 v1 2026-06-21T09:41:32.413Z