首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A unified framework to prove multiplicative inequalities for the partition function
Institution:Research Institute for Symbolic Computation, Johannes Kepler University, Altenberger Strasse 69, A-4040 Linz, Austria
Abstract:In this paper, we consider a certain class of inequalities for the partition function of the following form:i=1Tp(n+si)i=1Tp(n+ri), which we call multiplicative inequalities. Given a multiplicative inequality with the condition that i=1Tsimi=1Trim for at least one m1, we shall construct a unified framework so as to decide whether such a inequality holds or not. As a consequence, we will see that study of such inequalities has manifold applications. For example, one can retrieve log-concavity property, strong log-concavity, and the multiplicative inequality for p(n) considered by Bessenrodt and Ono, to name a few. Furthermore, we obtain an asymptotic expansion for the finite difference of the logarithm of p(n), denoted by (1)r1Δrlogp(n), which generalizes a result by Chen, Wang, and Xie.
Keywords:Partition function  Hardy-Ramanujan-Rademacher formula  log-concavity  Finite difference  Partition inequalities
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号