Higher Tur\'an inequalities for the plane partition function

Abstract

Here we study the roots of the doubly infinite family of Jensen polynomials JPLd,n(x) associated to MacMahon's plane partition function PL(n). Recently, Ono, Pujahari, and Rolen proved that PL(n) is log-concave for all n≥ 12, which is equivalent to the polynomials JPL2,n(x) having real roots. Moreover, they proved, for each d≥ 2, that the JPLd,n(x) have all real roots for sufficiently large n. Here we make their result effective. Namely, if NPL(d) is the minimal integer such that JPLd,n(x) has all real roots for all n≥ NPL(d), then we show that NPL(d)≤ 279928· d(d-1)· (6 d3· (22.2)3(d-1)2)2d e(2d2)(2π)2d+2 . Moreover, using the ideas that led to the above inequality, we explicitly prove that NPL(3)=26, NPL(4)=46, NPL(5)=73, NPL(6)=102 and NPL(7)=136.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…