Diagonal Asymptotics for Products of Combinatorial Classes

Abstract

We generalize and improve recent results by Bóna and Knopfmacher and by Banderier and Hitcz-enko concerning the joint distribution of the sum and number of parts in tuples of restricted compositions. Specifically, we generalize the problem to general combinatorial classes and relax the requirement that the sizes of the compositions be equal. We extend the main explicit results to enumeration problems whose counting sequences are Riordan arrays. In this framework, we give an alternative method for computing asymptotics in the supercritical case, which avoids explicit diagonal extraction.