Polynomization of the Liu-Zhang inequality for overpartition function

TL;DR

This paper provides a combinatorial proof of an inequality involving the overpartition function, extending it to polynomials that generalize colored partition functions, and explores its validity across various parameters.

Contribution

It introduces the polynomials P_n(x) for overpartitions and proves a generalized inequality using combinatorial and analytic methods.

Findings

The inequality P_a(x)P_b(x)>P_{a+b}(x) holds for positive integers a, b and real x  1, except for specific cases.

The paper extends the Liu-Zhang inequality to a polynomial setting involving overpartitions.

Provides a combinatorial proof for an inequality previously shown analytically.

Abstract

Let $\overline{p}(n)$ denote the overpartition function. Liu and Zhang showed that $\overline{p}(a) \overline{p}(b)>\overline{p}(a+b)$ for all integers $a,b>1$ by using an analytic result of Engle. We offer in this paper a combinatorial proof to the Liu-Zhang inequaity. More precisely, motivated by the polynomials $P_{n}(x)$ , which generalize the $k$-colored partitions function $p_{-k}(n)$, we introduce the polynomials $\overline{P}_{n}(x)$, which take the number of $k$-colored overpartitions of $n$ as their special values. And by combining combinatorial and analytic approaches, we obtain that $\overline{P}_{a}(x) \overline{P}_{b}(x)>\overline{P}_{a+b}(x)$ for all positive integers $a,b$ and real numbers $x \ge 1$ , except for $(a,b,x)=(1,1,1),(2,1,1),(1,2,1)$.