A unified treatment of families of partition functions

Abstract

We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and verify several claims that are posted on the On-Line Encyclopedia of Integer Sequences. We perform the asymptotic analysis by systematically applying the Mellin transform, residue analysis, and the saddle point method. The combinatorial descriptions of these families of generalized partition functions involve colorings of Young tableaux, along with their ``divisor diagrams'', denoted with sets of colors whose sizes are controlled by divisor functions.