No CrossRef data available.
Article contents
Diagonal Asymptotics for Products of Combinatorial Classes
Published online by Cambridge University Press: 10 October 2014
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.
Keywords
- Type
- Paper
- Information
- Combinatorics, Probability and Computing , Volume 24 , Special Issue 1: Honouring the Memory of Philippe Flajolet - Part 3 , January 2015 , pp. 354 - 372
- Copyright
- Copyright © Cambridge University Press 2014