Tur\'an inequalities for the broken k-diamond partition function
Abstract
We obtain an asymptotic formula for Andrews and Paule's broken k-diamond partition function k(n) where k=1 or 2. Based on this asymptotic formula, we derive that k(n) satisfies the order d Tur\'an inequalities for d≥ 1 and for sufficiently large n when k=1 and 2 by using a general result of Griffin, Ono, Rolen and Zagier. We also show that Andrews and Paule's broken k-diamond partition function k(n) is log-concave for n≥ 1 when k=1 and 2. This leads to k(a)k(b)k(a+b) for a,b 1 when k=1 and 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.