Asymptotics and inequalities for the broken k-diamond partition function
Abstract
Many papers have studied inequalities for Andrews and Paule's broken k-diamond partition function Δk(n) when k=1 or 2. In this paper, we derive an exact formula for Δk(n) when k≥ 1. Building on this result, we also derive an asymptotic formula for Δk(n) with an explicit error bound. Using this formula, we prove that for k≥ 1 and sufficiently large n, Δk(n) satisfies the Turán and Laguerre inequalities of any order and exhibits asymptotic complete monotonicity. Define nk:=\8k3+k+112,526\. Furthermore, we show that Δk(n) is log-concave for k3 and n nk. Consequently, it follows that Δk(a)Δk(b)Δk(a+b) for k3 and a,b nk.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.