English

Hyperbolicity of the partition Jensen polynomials

Number Theory 2019-04-30 v1

Abstract

Given an arithmetic function a:NRa: \mathbb{N} \rightarrow \mathbb{R}, one can associate a naturally defined, doubly infinite family of Jensen polynomials. Recent work of Griffin, Ono, Rolen, and Zagier shows that for certain families of functions a:NRa: \mathbb{N} \rightarrow \mathbb{R}, the associated Jensen polynomials are eventually hyperbolic (i.e., eventually all of their roots are real). This work proves Chen, Jia, and Wang's conjecture that the partition Jensen polynomials are eventually hyperbolic as a special case. Here, we make this result explicit. Let N(d)N(d) be the minimal number such that for all nN(d)n \geq N(d), the partition Jensen polynomial of degree dd and shift nn is hyperbolic. We prove that N(3)=94N(3)=94, N(4)=206N(4)=206, and N(5)=381N(5)=381, and in general, that N(d)(3d)24d(50d)3d2N(d) \leq (3d)^{24d} (50d)^{3d^{2}}.

Keywords

Cite

@article{arxiv.1904.12727,
  title  = {Hyperbolicity of the partition Jensen polynomials},
  author = {Hannah Larson and Ian Wagner},
  journal= {arXiv preprint arXiv:1904.12727},
  year   = {2019}
}
R2 v1 2026-06-23T08:52:22.349Z