English

Log-Concavity of Infinite Product Generating Functions

Combinatorics 2022-06-23 v2

Abstract

In the 19701970s Nicolas proved that the coefficients pd(n)p_d(n) defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for d=1d=1. Recently, Ono, Pujahari, and Rolen have extended the result to d=2d=2. Note that p1(n)=p(n)p_1(n)=p(n) is the partition function and p2(n)=\funcpp(n)p_2(n)=\func{pp}\left( n\right) is the number of plane partitions. In this paper, we invest in properties for pd(n)p_d(n) for general dd. Let n6n \geq 6. Then pd(n)p_d(n) is almost log-concave for nn divisible by 33 and almost strictly log-convex otherwise.

Cite

@article{arxiv.2202.00627,
  title  = {Log-Concavity of Infinite Product Generating Functions},
  author = {Bernhard Heim and Markus Neuhauser},
  journal= {arXiv preprint arXiv:2202.00627},
  year   = {2022}
}
R2 v1 2026-06-24T09:14:07.703Z