Finite differences of the logarithm of the partition function

From MaRDI portal




Abstract: Let p(n) denote the partition function. DeSalvo and Pak proved that fracp(n1)p(n)left(1+frac1night)>fracp(n)p(n+1) for ngeq2, as conjectured by Chen. Moreover, they conjectured that a sharper inequality fracp(n1)p(n)left(1+fracpisqrt24n3/2ight)>fracp(n)p(n+1) holds for ngeq45. In this paper, we prove the conjecture of Desalvo and Pak by giving an upper bound for Delta2logp(n1), where Delta is the difference operator with respect to n. We also show that for given rgeq1 and sufficiently large n, (1)r1Deltarlogp(n)>0. This is analogous to the positivity of finite differences of the partition function. It was conjectured by Good and proved by Gupta that for given rgeq1, Deltarp(n)>0 for sufficiently large n.




Cited in
(31)








This page was built for publication: Finite differences of the logarithm of the partition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2792343)