@article{wilson2015diagonal,
  title={Diagonal asymptotics for products of combinatorial classes},
  author={Wilson, Mark C.},
  journal={Combinatorics, Probability and Computing},
  volume={24},
  number={1},
  pages={354-372},
  year={2015},
  publisher={Cambridge University Press},
  keywords={ACSV theory},
  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E},
  abstract={We generalize and improve recent results by B\'{o}na and Knopfmacher and
by Banderier and Hitczenko 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 and seems likely to be computationally more
efficient.}
}

{"_id":"xYcC5R763sin7f6ri","bibbaseid":"wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015","author_short":["Wilson, M. C."],"bibdata":{"bibtype":"article","type":"article","title":"Diagonal asymptotics for products of combinatorial classes","author":[{"propositions":[],"lastnames":["Wilson"],"firstnames":["Mark","C."],"suffixes":[]}],"journal":"Combinatorics, Probability and Computing","volume":"24","number":"1","pages":"354-372","year":"2015","publisher":"Cambridge University Press","keywords":"ACSV theory","url_paper":"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E","abstract":"We generalize and improve recent results by Bóna and Knopfmacher and by Banderier and Hitczenko 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 and seems likely to be computationally more efficient.","bibtex":"@article{wilson2015diagonal,\n title={Diagonal asymptotics for products of combinatorial classes},\n author={Wilson, Mark C.},\n journal={Combinatorics, Probability and Computing},\n volume={24},\n number={1},\n pages={354-372},\n year={2015},\n publisher={Cambridge University Press},\n keywords={ACSV theory},\n url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E},\n abstract={We generalize and improve recent results by B\\'{o}na and Knopfmacher and\nby Banderier and Hitczenko concerning the joint distribution of the sum\nand number of parts in tuples of restricted compositions. Specifically,\nwe generalize the problem to general combinatorial classes and relax the\nrequirement that the sizes of the compositions be equal. We extend the\nmain explicit results to enumeration problems whose counting sequences\nare Riordan arrays. In this framework, we give an alternative method\nfor computing asymptotics in the supercritical case, which avoids\nexplicit diagonal extraction and seems likely to be computationally more\nefficient.}\n}\n\n","author_short":["Wilson, M. C."],"key":"wilson2015diagonal","id":"wilson2015diagonal","bibbaseid":"wilson-diagonalasymptoticsforproductsofcombinatorialclasses-2015","role":"author","urls":{" paper":"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/diagonal-asymptotics-for-products-of-combinatorial-classes/DE65A4AA078A6161905DD6CEFBEDC85E"},"keyword":["ACSV theory"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"article","biburl":"https://drive.google.com/uc?export=download&id=1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF","dataSources":["yx9ivfGLzvFNsg4LH","QdFdNQZBZSvbPbp7t","o2FBsFrZMS3PxguCG","SjBh38uzaGjRinwq8","M2T285kj8vXfTkGDx","2zimNJgtWEiEM2L3J","TAyBmAZAcnenc4YET","BCqQErP8wgW48bwvt","YjweTJPHHEQ85Pems"],"keywords":["acsv theory"],"search_terms":["diagonal","asymptotics","products","combinatorial","classes","wilson"],"title":"Diagonal asymptotics for products of combinatorial classes","year":2015,"downloads":1}