2000 character limit reached
Turán inequalities for the plane partition function
Published 4 Jan 2022 in math.NT and math.CO | (2201.01352v3)
Abstract: Heim, Neuhauser, and Tr\"oger recently established some inequalities for MacMahon's plane partition function $\mathrm{PL}(n)$ that generalize known results for Euler's partition function $p(n)$. They also conjectured that $\mathrm{PL}(n)$ is log-concave for all $n\geq 12.$ We prove this conjecture. Moreover, for every $d\geq 1$, we prove their speculation that $\mathrm{PL}(n)$ satisfies the degree $d$ Tur\'an inequality for sufficiently large $n$. The case where $d=2$ is the case of log-concavity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.