Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Inequalities for the Broken $k$-Diamond Partition Function (2209.07056v1)

Published 15 Sep 2022 in math.NT and math.CO

Abstract: In 2007, Andrews and Paule introduced the broken $k$-diamond partition function $\Delta_k(n)$, which has received a lot of researches on the arithmetic propertises. In this paper, we prove that $D3\log \Delta_1(n-1)>0$ for $n\geq 5$ and $D3 \log \Delta_2(n-1)>0$ for $n\geq 7$, where $D$ is the difference operator with respect to $n$. We also conjecture that for any $k\geq 1$ and $r\geq 1$, there exists a positive integer $n_k(r)$ such that for $n\geq n_{k}(r)$, $(-1)r Dr \log \Delta_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 ${\Delta_1(n)}{n\geq 0}$ and ${\Delta_2(n)}{n\geq 0}$ satisfy the higher order Tur\'an inequalities for $n \geq 6$.

Summary

We haven't generated a summary for this paper yet.