Skip to main content Accessibility help

Diagonal Asymptotics for Products of Combinatorial Classes

  • MARK C. WILSON (a1)


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.



Hide All
[1] Banderier, C. and Flajolet, P. (2002) Basic analytic combinatorics of directed lattice paths. Theoret. Comput. Sci. 281 3780.
[2] Banderier, C. and Hitczenko, P. (2012) Enumeration and asymptotics of restricted compositions having the same number of parts. Discrete Appl. Math. 160 25422554.
[3] Bóna, M. and Flajolet, P. (2009) Isomorphism and symmetries in random phylogenetic trees. J. Appl. Probab. 46 10051019.
[4] Bóna, M. and Knopfmacher, A. (2010) On the probability that certain compositions have the same number of parts. Ann. Combin. 14 291306.
[5] Bostan, A., Lairez, P. and Salvy, B. (2013) Creative telescoping for rational functions using the Griffiths–Dwork method. In ISSAC (Monagna, M. B., Cooperman, G. and Giesbrecht, M., eds), ACM, pp. 93100.
[6] Fill, J. A., Flajolet, P. and Kapur, N. (2005) Singularity analysis, Hadamard products, and tree recurrences. J. Comput. Appl. Math. 174 271313.
[7] Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
[8] Flaxman, A., Harrow, A. W. and Sorkin, G. B. (2004) Strings with maximally many distinct subsequences and substrings. Electron. J. Combin. 11 R8.
[9] Labelle, J. and Yeh, Y. N. (1990) Generalized Dyck paths. Discrete Math. 82 16.
[10] Merlini, D., Rogers, D. G., Sprugnoli, R. and Verri, M. C. (1997) On some alternative characterizations of Riordan arrays. Canad. J. Math. 49 301320.
[11] Noble, R. (2010) Asymptotics of a family of binomial sums. J. Number Theory 130 25612585.
[12] OEIS Foundation (2013) On-Line Encyclopedia of Integer Sequences.
[13] Pemantle, R. and Wilson, M. C. (2002) Asymptotics of multivariate sequences I: Smooth points of the singular variety. J. Combin. Theory, Ser. A 97 129161.
[14] Pemantle, R. and Wilson, M. C. (2008) Twenty combinatorial examples of asymptotics derived from multivariate generating functions. SIAM Rev. 50 199272.
[15] Pemantle, R. and Wilson, M. C. (2013) Analytic Combinatorics in Several Variables, Cambridge University Press.
[16] Raichev, A. (2013) amgf-0.8.
[17] Raichev, A. and Wilson, M. C. (2007) A new method for computing asymptotics of diagonal coefficients of multivariate generating functions. In 2007 Conference on Analysis of Algorithms: AofA 07, DMTCS Proc. AH, pp. 439–449.
[18] Raichev, A. and Wilson, M. C. (2008) Asymptotics of coefficients of multivariate generating functions: Improvements for smooth points. Electron. J. Combin. 15 R89.
[19] Shapiro, L. W., Getu, S., Woan, W. J. and Woodson, L. C. (1991) The Riordan group. Discrete Appl. Math. 34 229239.
[20] Singer, N., Shouldice, A., Ye, L., Daske, T., Dobcsanyi, P., Manna, D., Chan, O.-Y. and Borwein, J. (2013) Inverse Symbolic Calculator.
[21] Wilson, M. C. (2005) Asymptotics for generalized Riordan arrays. In 2005 International Conference on Analysis of Algorithms, DMTCS Proc. AD, pp. 323–333.


Related content

Powered by UNSILO

Diagonal Asymptotics for Products of Combinatorial Classes

  • MARK C. WILSON (a1)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.