Polynomization of the Liu-Zhang inequality for overpartition function

arXiv2206.15001MaRDI QIDQ6403582FDOQ6403582

Authors: Xixi Li 

Publication date: 29 June 2022

Abstract: Let $overlinep(n)$ denote the overpartition function. Liu and Zhang showed that $overlinep(a)overlinep(b)>overlinep(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 $xge1$ , except for $(a,b,x)=(1,1,1),(2,1,1),(1,2,1)$.

This page was built for publication: Polynomization of the Liu-Zhang inequality for overpartition function

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