The Log-Behavior of [n]p(n) and [n]p(n)/n
Abstract
Let p(n) denote the partition function. Desalvo and Pak proved the log-concavity of p(n) for n>25 and the inequality p(n-1)p(n)(1+1n)>p(n)p(n+1) for n>1. Let r(n)=[n]p(n)/n and be the difference operator respect to n. Desalvo and Pak pointed out that their approach to proving the log-concavity of p(n) may be employed to prove a conjecture of Sun on the log-convexity of \r(n)\n≥ 61, as long as one finds an appropriate estimate of 2 r(n-1). In this paper, we obtain a lower bound for 2 r(n-1), leading to a proof of this conjecture. From the log-convexity of \r(n)\n≥61 and \[n]n\n≥4, we are led to a proof of another conjecture of Sun on the log-convexity of \[n]p(n)\n≥27. Furthermore, we show that n → +∞n522[n]p(n)=3π/24. Finally, by finding an upper bound of 2 [n-1]p(n-1), we prove an inequality on the ratio [n-1]p(n-1)[n]p(n) analogous to the above inequality on the ratio p(n-1)p(n).
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.