Inequalities for the Broken k-Diamond Partition Function
Abstract
In 2007, Andrews and Paule introduced the broken k-diamond partition function k(n), which has received a lot of researches on the arithmetic propertises. In this paper, we prove that D3 1(n-1)>0 for n≥ 5 and D3 2(n-1)>0 for n≥ 7, where D is the difference operator with respect to n. We also conjecture that for any k≥ 1 and r≥ 1, there exists a positive integer nk(r) such that for n≥ nk(r), (-1)r Dr k(n)>0. This is analogous to the positivity of finite differences of the logarithm of the partition function, which has been proved by Chen, Wang and Xie. Furthermore, we obtain that both \1(n)\n≥ 0 and \2(n)\n≥ 0 satisfy the higher order Tur\'an inequalities for n ≥ 6.
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.