2000 character limit reached
Inequalities for the overpartition function arising from determinants
Published 19 Jan 2022 in math.NT | (2201.07840v1)
Abstract: Let $\overline{p}(n)$ denote the overpartition funtion. This paper presents the $2$-$\log$-concavity property of $\overline{p}(n)$ by considering a more general inequality of the following form \begin{equation*} \begin{vmatrix} \overline{p}(n) & \overline{p}(n+1) & \overline{p}(n+2) \ \overline{p}(n-1) & \overline{p}(n) & \overline{p}(n+1) \ \overline{p}(n-2) & \overline{p}(n-1) & \overline{p}(n) \end{vmatrix} > 0, \end{equation*} which holds for all $n \geq 42$.
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.