On the Bessenrodt-Ono type inequality for a wide class of $A$-partition functions

Abstract

The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function $p_A\left(\boldsymbolμ\right)$ is defined as an multiplicative extension of the $A$-partition function to a function on $A$-partitions. In this paper, we investigate the Bessenrodt-Ono type inequality for a wide class of $A$-partition functions. In particular, we examine the property for both the $m$-ary partition function $b_m(n)$ and the $d$-th power partition function $p_d(n)$. Moreover, we show that $b_m(\boldsymbolμ)$ ($p_d(\boldsymbolμ)$) takes its maximum value at an explicitly described set of $m$-ary partitions (power partitions), where $\boldsymbolμ$ is an $m$-ary partition (a power partition) of $n$. Additionally, we exhibit analogous results for the Fibonacci partition function and the `factorial' partition function. It is worth pointing out that an elementary combinatorial reasoning plays a crucial role in our investigation.

Theorems & Definitions (34)

• Theorem 1.1: DeSalvo-Pak, Nicolas
• Theorem 1.2: Bessenrodt-Ono
• Theorem 1.3: Bessenrodt-Ono
• Theorem 1.4
• Theorem 3.1
• proof
• Remark 3.2
• proof : Proof of Theorem \ref{['Theorem: General B-O']}
• Lemma 4.1
• proof