Log-concavity of the restricted partition function pA(n,k) and the new Bessenrodt-Ono type inequality

Abstract

Let A=(ai)i=1∞ be a non-decreasing sequence of positive integers and let k∈N+ be fixed. The function pA(n,k) counts the number of partitions of n with parts in the multiset \a1,a2,…,ak\. We find out a new type of Bessenrodt-Ono inequality for the function pA(n,k). Further, we discover when and under what conditions on k, \a1,a2,…,ak\ and N∈N+, the sequence (pA(n,k))n=N∞ is log-concave. Our proofs are based on the asymptotic behavior of pA(n,k), in particular, we apply the results of Netto and P\'olya-Szeg\"o as well as the Almkavist's estimation.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…