Polynomization of the Bessenrodt-Ono type inequalities for A-partition functions

TL;DR

This paper introduces a polynomial framework for A-partition functions, extending Bessenrodt--Ono inequalities, and provides criteria for their solutions along with properties of related functions.

Contribution

It develops a polynomization of Bessenrodt--Ono inequalities for A-partition functions and explores their properties and solution criteria.

Findings

Established polynomial inequalities for A-partition functions.

Provided criteria for solutions to the polynomial inequalities.

Analyzed properties of the associated polynomial functions.

Abstract

For an arbitrary set or multiset $A$ of positive integers, we associate the $A$-partition function $p_A(n)$ (that is the number of partitions of $n$ whose parts belong to $A$). We also consider the analogue of the $k$-colored partition function, namely, $p_{A,-k}(n)$. Further, we define a family of polynomials $f_{A,n}(x)$ which satisfy the equality $f_{A,n}(k)=p_{A,-k}(n)$ for all $n\in\mathbb{Z}_{\geq0}$ and $k\in\mathbb{N}$. This paper concerns the polynomization of the Bessenrodt--Ono type inequality for $f_{A,n}(x)$: \begin{align*} f_{A,a}(x)f_{A,b}(x)>f_{A,a+b}(x), \end{align*} where $a$ and $b$ are arbitrary positive integers; and delivers some efficient criteria for its solutions. Moreover, we also investigate a few basic properties related to both functions $f_{A,n}(x)$ and $f_{A,n}'(x)$.