var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&jsonp=1&authorFirst=1&sort=-year&theme=side&filter=keywords:ACSV&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&jsonp=1&authorFirst=1&sort=-year&theme=side&filter=keywords:ACSV\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fdrive.google.com%2Fuc%3Fexport%3Ddownload%26id%3D1NEXsxwRAx2CWt43v0y0jyZdP1LdOS_xF&jsonp=1&authorFirst=1&sort=-year&theme=side&filter=keywords:ACSV\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2022\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Greenwood, T.; Melczer, S.; Ruza, T.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract).\n \n \n \n \n\n\n \n\n\n\n Séminaire Lotharingien de Combinatoire, 86B: 12pp. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n \n \"Asymptotics slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@Article{GMRW2022,\nauthor = {Greenwood, Torin and Melczer, Stephen and Ruza, Tiadora and Wilson, Mark C.},\njournal = {S\\'{e}minaire Lotharingien de Combinatoire},\nabstract = {We present a strategy for computing asymptotics of coefficients of\n$d$-variate algebraic generating functions. Using known constructions,\nwe embed the coefficient array into an array represented by a rational\ngenerating functions in $d+1$ variables, and then apply ACSV theory to\nanalyse the latter. This method allows us to give systematic results in\nthe multivariate case, seems more promising than trying to derive\nanalogs of the rational ACSV theory for algebraic GFs, and gives the\nprospect of further improvements as embedding methods are studied in\nmore detail.},\ntitle = {Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract)},\nyear = {2022},\npages = {12pp},\nvolume = {86B}, \nkeywords={ACSV applications, ACSV theory},\nurl_paper = {https://www.emis.de/journals/SLC/wpapers/FPSAC2022/30.pdf},\nurl_slides = {},\n}\n\n
\n
\n\n\n
\n We present a strategy for computing asymptotics of coefficients of $d$-variate algebraic generating functions. Using known constructions, we embed the coefficient array into an array represented by a rational generating functions in $d+1$ variables, and then apply ACSV theory to analyse the latter. This method allows us to give systematic results in the multivariate case, seems more promising than trying to derive analogs of the rational ACSV theory for algebraic GFs, and gives the prospect of further improvements as embedding methods are studied in more detail.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Ramgoolam, S.; Wilson, M. C; and Zahabi, A.\n\n\n \n \n \n \n \n Quiver asymptotics: free chiral ring.\n \n \n \n \n\n\n \n\n\n\n Journal of Physics A: Mathematical and Theoretical, 53(10): 105401. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Quiver paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{ramgoolam2020quiver,\n  title={Quiver asymptotics: free chiral ring},\n  author={Ramgoolam, Sanjaye and Wilson, Mark C and Zahabi, Ali},\n  journal={Journal of Physics A: Mathematical and Theoretical},\n  volume={53},\n  number={10},\n  pages={105401},\n  year={2020},\n  publisher={IOP Publishing},\n  keywords={ACSV applications},\n  url_Paper={https://iopscience.iop.org/article/10.1088/1751-8121/ab6fc6/pdf},\n  abstract={The large N generating functions for the counting of chiral operators in\n$\\mathcal{N} = 1$, four-dimensional quiver gauge theories have\npreviously been obtained in terms of the weighted adjacency matrix of\nthe quiver diagram. We introduce the methods of multi-variate asymptotic\nanalysis to study this counting in the limit of large charges. We\ndescribe a Hagedorn phase transition associated with this asymptotics,\nwhich refines and generalizes known results on the 2-matrix harmonic\noscillator. Explicit results are obtained for two infinite classes of\nquiver theories, namely the generalized clover quivers and affine\n$\\mathbb{C}^3 \\setminus \\hat{A}_n$ orbifold quivers.}\n}\n\n\n\n
\n
\n\n\n
\n The large N generating functions for the counting of chiral operators in $\\mathcal{N} = 1$, four-dimensional quiver gauge theories have previously been obtained in terms of the weighted adjacency matrix of the quiver diagram. We introduce the methods of multi-variate asymptotic analysis to study this counting in the limit of large charges. We describe a Hagedorn phase transition associated with this asymptotics, which refines and generalizes known results on the 2-matrix harmonic oscillator. Explicit results are obtained for two infinite classes of quiver theories, namely the generalized clover quivers and affine $ℂ^3 ∖ Â_n$ orbifold quivers.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Melczer, S.; and Wilson, M. C.\n\n\n \n \n \n \n \n Higher dimensional lattice walks: Connecting combinatorial and analytic behavior.\n \n \n \n \n\n\n \n\n\n\n SIAM Journal on Discrete Mathematics, 33(4): 2140-2174. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Higher paper\n  \n \n \n \"Higher slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Article{melczer2019higher,\n  author     = {Melczer, Stephen and Wilson, Mark C.},\n  title      = {Higher dimensional lattice walks: Connecting combinatorial and analytic behavior},\n  number     = {4},\n  pages      = {2140-2174},\n  volume     = {33},\n  abstract   = {We consider the enumeration of walks on the non-negative lattice\n$\\mathbb{N}^d$, with steps defined by a set $\\mathcal{S} \\subset \\{ -1,\n0, 1 \\}^d \\setminus \\{\\mathbf{0}\\}$. Previous work in this area has\nestablished asymptotics for the number of walks in certain families of\nmodels by applying the techniques of analytic combinatorics in several\nvariables (ACSV), where one encodes the generating function of a lattice\npath model as the diagonal of a multivariate rational function. Melczer\nand Mishna obtained asymptotics when the set of steps $\\mathcal{S}$ is\nsymmetric over every axis; in this setting one can always apply the\nmethods of ACSV to a multivariate rational function whose  set of\nsingularities is a smooth manifold (the simplest case). Here we go\nfurther, providing asymptotics for models with generating functions that\nmust be encoded by multivariate rational functions having non-smooth\nsingular sets.  In the process, our analysis connects past work to\ndeeper structural results in the theory of analytic combinatorics in\nseveral variables.  One application is a closed form for asymptotics of\nmodels defined by step sets that are symmetric over all but one axis. As\na special case, we apply our results when $d=2$ to give a rigorous proof\nof asymptotics conjectured by Bostan and Kauers; asymptotics for walks\nreturning to boundary axes and the origin are also given.},\n  journal    = {SIAM Journal on Discrete Mathematics},\n  keywords   = {ACSV applications},\n  publisher  = {Society for Industrial and Applied Mathematics},\n  url_paper  = {https://arxiv.org/abs/1810.06170},\n  url_slides = {https://www.youtube.com/watch?v=o5SOHJbGO4g},\n  year       = {2019},\n}\n\n
\n
\n\n\n
\n We consider the enumeration of walks on the non-negative lattice $ℕ^d$, with steps defined by a set $\\mathcal{S} ⊂ \\{ -1, 0, 1 \\}^d ∖ \\{\\mathbf{0}\\}$. Previous work in this area has established asymptotics for the number of walks in certain families of models by applying the techniques of analytic combinatorics in several variables (ACSV), where one encodes the generating function of a lattice path model as the diagonal of a multivariate rational function. Melczer and Mishna obtained asymptotics when the set of steps $\\mathcal{S}$ is symmetric over every axis; in this setting one can always apply the methods of ACSV to a multivariate rational function whose set of singularities is a smooth manifold (the simplest case). Here we go further, providing asymptotics for models with generating functions that must be encoded by multivariate rational functions having non-smooth singular sets. In the process, our analysis connects past work to deeper structural results in the theory of analytic combinatorics in several variables. One application is a closed form for asymptotics of models defined by step sets that are symmetric over all but one axis. As a special case, we apply our results when $d=2$ to give a rigorous proof of asymptotics conjectured by Bostan and Kauers; asymptotics for walks returning to boundary axes and the origin are also given.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Melczer, S.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of lattice walks via analytic combinatorics in several variables.\n \n \n \n \n\n\n \n\n\n\n In 2016 Conference on Formal Power Series and Algebraic Combinatorics, FPSAC2016, of Discrete Math. Theor. Comput. Sci. Proc., AH, pages 863-874, 2016. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@inproceedings {MeWi2016, \nAUTHOR = {Stephen Melczer and Wilson, Mark C.},\n     TITLE = {Asymptotics of lattice walks via analytic combinatorics in several variables},\n BOOKTITLE = {2016 {C}onference on {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics, FPSAC2016},\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AH},\n     PAGES = {863-874},\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n      YEAR = {2016},\n  keywords={ACSV applications},\n  url_Paper={https://dmtcs.episciences.org/6390/pdf},\n  abstract={We consider the enumeration of walks on the two dimensional non-negative\ninteger lattice with short steps. Up to isomorphism there are 79 unique\ntwo dimensional models to consider, and previous work in this area has\nused the kernel method, along with a rigorous computer algebra approach,\nto show that 23 of the 79 models admit D-finite generating functions. In\n2009, Bostan and Kauers used Pad\\'{e}-Hermite approximants to guess\ndifferential equations which these 23 generating functions satisfy, in\nthe process guessing asymptotics of their coefficient sequences. In this\narticle we provide, for the first time, a complete rigorous verification\nof these guesses. Our technique is to use the kernel method to express\n19 of the 23 generating functions as diagonals of tri-variate rational\nfunctions and apply the methods of analytic combinatorics in several\nvariables (the remaining 4 models have algebraic generating functions\nand can thus be handled by univariate techniques). This approach also\nshows the link between combinatorial properties of the models and\nfeatures of its asymptotics such as asymptotic and polynomial growth\nfactors. In addition, we give expressions for the number of walks\nreturning to the x-axis, the y-axis, and the origin, proving recently\nconjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.}\n  \n}\n\n\n
\n
\n\n\n
\n We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method, along with a rigorous computer algebra approach, to show that 23 of the 79 models admit D-finite generating functions. In 2009, Bostan and Kauers used Padé-Hermite approximants to guess differential equations which these 23 generating functions satisfy, in the process guessing asymptotics of their coefficient sequences. In this article we provide, for the first time, a complete rigorous verification of these guesses. Our technique is to use the kernel method to express 19 of the 23 generating functions as diagonals of tri-variate rational functions and apply the methods of analytic combinatorics in several variables (the remaining 4 models have algebraic generating functions and can thus be handled by univariate techniques). This approach also shows the link between combinatorial properties of the models and features of its asymptotics such as asymptotic and polynomial growth factors. In addition, we give expressions for the number of walks returning to the x-axis, the y-axis, and the origin, proving recently conjectured asymptotics of Bostan, Chyzak, van Hoeij, Kauers, and Pech.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Wilson, M. C.\n\n\n \n \n \n \n \n Diagonal asymptotics for products of combinatorial classes.\n \n \n \n \n\n\n \n\n\n\n Combinatorics, Probability and Computing, 24(1): 354-372. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"Diagonal paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@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
\n
\n\n\n
\n 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.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Pemantle, R.; and Wilson, M. C.\n\n\n \n \n \n \n \n Analytic combinatorics in several variables.\n \n \n \n \n\n\n \n\n\n\n Cambridge University Press, 2013.\n \n\n\n\n
\n\n\n\n \n \n \"Analytic paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@book{pemantle2013analytic,\n  title={Analytic combinatorics in several variables},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  year={2013},\n  publisher={Cambridge University Press},\n  keywords={ACSV theory},\n  url_Paper={},\n  abstract={}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Raichev, A.; and Wilson, M. C.\n\n\n \n \n \n \n \n A new approach to asymptotics of Maclaurin coefficients of algebraic functions.\n \n \n \n \n\n\n \n\n\n\n arXiv preprint arXiv:1202.3826. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{raichev2012new,\n  title={A new approach to asymptotics of Maclaurin coefficients of algebraic functions},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1202.3826},\n  year={2012},\n  keywords={ACSV theory},\n  url_Paper={https://arxiv.org/pdf/1202.3826.pdf},\n  abstract={We propose a general method for deriving asymptotics of the Maclaurin\nseries coefficients of algebraic functions that is based on a procedure of K. V. Safonov\nand multivariate singularity analysis. We test the feasibility of this this approach by\nexperimenting on several examples.}\n}\n\n
\n
\n\n\n
\n We propose a general method for deriving asymptotics of the Maclaurin series coefficients of algebraic functions that is based on a procedure of K. V. Safonov and multivariate singularity analysis. We test the feasibility of this this approach by experimenting on several examples.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Raichev, A.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of coefficients of multivariate generating functions: improvements for multiple points.\n \n \n \n \n\n\n \n\n\n\n arXiv preprint arXiv:1009.5715. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{raichev2010asymptotics,\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for multiple points},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={arXiv preprint arXiv:1009.5715},\n  year={2010},\n  keywords={ACSV theory},\n  url_Paper={},\n  abstract={Let $F(x)= \\sum_{\\nu\\in\\mathbb{N}^d} F_\\nu x^\\nu$ be a multivariate\npower series with complex coefficients that converges in a neighborhood\nof the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic\nin a neighborhood of the origin. We derive asymptotics for the\ncoefficients $F_{r\\alpha}$ as $r \\to \\infty$ with $r\\alpha \\in\n\\mathbb{N}^d$ for $\\alpha$ in a permissible subset of $d$-tuples of\npositive reals. More specifically, we give an algorithm for computing\narbitrary terms of the asymptotic expansion for $F_{r\\alpha}$ when the\nasymptotics are controlled by a transverse multiple point of the\nanalytic variety $H = 0$. This improves upon earlier work  by R.\nPemantle and M. C. Wilson. We have implemented our algorithm in Sage and\napply it to obtain accurate numerical results for several rational\ncombinatorial generating functions.}\n}\n\n
\n
\n\n\n
\n Let $F(x)= ∑_{ν∈ℕ^d} F_ν x^ν$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin. We derive asymptotics for the coefficients $F_{rα}$ as $r \\to ∞$ with $rα ∈ ℕ^d$ for $α$ in a permissible subset of $d$-tuples of positive reals. More specifically, we give an algorithm for computing arbitrary terms of the asymptotic expansion for $F_{rα}$ when the asymptotics are controlled by a transverse multiple point of the analytic variety $H = 0$. This improves upon earlier work by R. Pemantle and M. C. Wilson. We have implemented our algorithm in Sage and apply it to obtain accurate numerical results for several rational combinatorial generating functions.\n
\n\n\n
\n\n\n
\n \n\n \n \n Pemantle, R.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotic expansions of oscillatory integrals with complex phase.\n \n \n \n \n\n\n \n\n\n\n In Algorithmic probability and combinatorics, volume 520, of Contemp. Math., pages 221-240. Amer. Math. Soc., Providence, RI, 2010.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotic paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@incollection {PeWi2010,\n    AUTHOR = {Pemantle, Robin and Wilson, Mark C.},\n     TITLE = {Asymptotic expansions of oscillatory integrals with complex\n              phase},\n BOOKTITLE = {Algorithmic probability and combinatorics},\n    SERIES = {Contemp. Math.},\n    VOLUME = {520},\n     PAGES = {221-240},\n PUBLISHER = {Amer. Math. Soc., Providence, RI},\n      YEAR = {2010},\n       keywords={ACSV theory},\n  url_Paper={https://arxiv.org/pdf/0903.3585.pdf},\n  abstract={We consider saddle point integrals in $d$ variables whose phase function\nis neither real nor purely imaginary. Results analogous to those for\nLaplace (real phase) and Fourier (imaginary phase) integrals hold\nwhenever the phase function is analytic and nondegenerate. These results\ngeneralize what is well known for integrals of Laplace and Fourier type.\nThe method is via contour shifting in complex $d$-space. This work is\nmotivated by applications to asymptotic enumeration.}\n}\n\n
\n
\n\n\n
\n We consider saddle point integrals in $d$ variables whose phase function is neither real nor purely imaginary. Results analogous to those for Laplace (real phase) and Fourier (imaginary phase) integrals hold whenever the phase function is analytic and nondegenerate. These results generalize what is well known for integrals of Laplace and Fourier type. The method is via contour shifting in complex $d$-space. This work is motivated by applications to asymptotic enumeration.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n Pemantle, R.; and Wilson, M. C.\n\n\n \n \n \n \n \n Twenty combinatorial examples of asymptotics derived from multivariate generating functions.\n \n \n \n \n\n\n \n\n\n\n SIAM Review, 50(2): 199-272. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Twenty paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{pemantle2008twenty,\n  title={Twenty combinatorial examples of asymptotics derived from multivariate generating functions},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={SIAM Review},\n  volume={50},\n  number={2},\n  pages={199-272},\n  year={2008},\n  publisher={Society for Industrial and Applied Mathematics},\n  keywords={ACSV theory},\n  url_Paper={https://epubs.siam.org/doi/epdf/10.1137/050643866},\n  abstract={Let $F$ be a power series in at least two variables that defines a\nmeromorphic function in a neighbourhood of the origin; for example, $F$\nmay be a rational multivariate generating function. We discuss recent\nresults that allow the effective computation of asymptotic expansions\nfor the coefficients of  $F$, uniform in certain explicitly defined\ncones of directions.\n\nThe purpose of this article is to illustrate the use of these techniques\non a variety of problems of combinatorial interest. The first part\nreviews the Morse-theoretic underpinnings of these techniques, and then\nsummarizes the necessary results so that only elementary analyses are\nneeded to check hypotheses and carry out computations. The remainder\nfocuses on combinatorial applications. Specific examples deal with\nenumeration of words with forbidden substrings, edges and cycles in\ngraphs, polyominoes, descents and solutions to integer equations. After\nthe individual examples, we discuss three broad classes of examples,\nnamely functions derived via the transfer matrix method, those derived\nvia the kernel method, and those derived via the method of Lagrange\ninversion. Generating functions derived in these three ways are amenable\nto our asymptotic analyses, and we state some further general results\nthat apply to these cases.}\n}\n\n
\n
\n\n\n
\n Let $F$ be a power series in at least two variables that defines a meromorphic function in a neighbourhood of the origin; for example, $F$ may be a rational multivariate generating function. We discuss recent results that allow the effective computation of asymptotic expansions for the coefficients of $F$, uniform in certain explicitly defined cones of directions. The purpose of this article is to illustrate the use of these techniques on a variety of problems of combinatorial interest. The first part reviews the Morse-theoretic underpinnings of these techniques, and then summarizes the necessary results so that only elementary analyses are needed to check hypotheses and carry out computations. The remainder focuses on combinatorial applications. Specific examples deal with enumeration of words with forbidden substrings, edges and cycles in graphs, polyominoes, descents and solutions to integer equations. After the individual examples, we discuss three broad classes of examples, namely functions derived via the transfer matrix method, those derived via the kernel method, and those derived via the method of Lagrange inversion. Generating functions derived in these three ways are amenable to our asymptotic analyses, and we state some further general results that apply to these cases.\n
\n\n\n
\n\n\n
\n \n\n \n \n Raichev, A.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of coefficients of multivariate generating functions: improvements for smooth points.\n \n \n \n \n\n\n \n\n\n\n Electronic Journal of Combinatorics,R89-R89. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{raichev2008asymptotics,\n  title={Asymptotics of coefficients of multivariate generating functions: improvements for smooth points},\n  author={Raichev, Alexander and Wilson, Mark C.},\n  journal={Electronic Journal of Combinatorics},\n  pages={R89-R89},\n  year={2008},\n  keywords={ACSV theory},\n  url_Paper={https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1r89/pdf},\n  abstract={Let $\\sum_{\\beta\\in\\mathbb{N}^d} F_\\beta x^\\beta$ be a multivariate\npower series, a generating function for a combinatorial class perhaps.\nAssume that in a neighborhood of the origin this series represents a\nnonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$\nis a positive integer. Given a direction $\\alpha\\in\\mathbb{N}_+^d$ for\nwhich asymptotics are controlled by a smooth point of the singular\nvariety $H = 0$, we compute the asymptotics of $F_{n\\alpha}$ as\n$n\\to\\infty$. We do this via multivariate singularity analysis and give\nan explicit formula for the full asymptotic expansion. This improves on\nearlier work of R. Pemantle and the second author, and allows for much\nmore accurate numerical approximation, as demonstrated in our examples.}\n}\n\n
\n
\n\n\n
\n Let $∑_{β∈ℕ^d} F_β x^β$ be a multivariate power series, a generating function for a combinatorial class perhaps. Assume that in a neighborhood of the origin this series represents a nonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$ is a positive integer. Given a direction $α∈ℕ_+^d$ for which asymptotics are controlled by a smooth point of the singular variety $H = 0$, we compute the asymptotics of $F_{nα}$ as $n\\to∞$. We do this via multivariate singularity analysis and give an explicit formula for the full asymptotic expansion. This improves on earlier work of R. Pemantle and the second author, and allows for much more accurate numerical approximation, as demonstrated in our examples.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Raichev, A.; and Wilson, M. C.\n\n\n \n \n \n \n \n A new method for computing asymptotics of diagonal coefficients of multivariate generating functions.\n \n \n \n \n\n\n \n\n\n\n In 2007 Conference on Analysis of Algorithms, AofA 07, of Discrete Math. Theor. Comput. Sci. Proc., AH, pages 439-449, 2007. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n \n\n\n\n
\n\n\n\n \n \n \"A link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@InProceedings{RaWi2007,\n  author    = {Raichev, Alexander and Wilson, Mark C.},\n  booktitle = {2007 {C}onference on {A}nalysis of {A}lgorithms, {A}of{A} 07},\n  title     = {A new method for computing asymptotics of diagonal coefficients of multivariate generating functions},\n  pages     = {439-449},\n  publisher = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n  series    = {Discrete Math. Theor. Comput. Sci. Proc., AH},\n  abstract  = {Let $\\sum_{\\mathbf{n}\\in\\mathbb{N}^d} F_\\mathbf{n}\n\\mathbf{x}^\\mathbf{n}$ be a multivariate generating function that\nconverges in a neighborhood of the origin of $\\mathbb{C}^d$. We present\na new, multivariate method for computing the asymptotics of the diagonal\ncoefficients $F_{a_1n,\\ldots,a_dn}$ and show its superiority over the\nstandard, univariate diagonal method. Several examples are given in\ndetail.},\n  keywords  = {ACSV theory},\n  url_link  = {https://dmtcs.episciences.org/3531/pdf},\n  year      = {2007},\n}\n\n
\n
\n\n\n
\n Let $∑_{\\mathbf{n}∈ℕ^d} F_\\mathbf{n} \\mathbf{x}^\\mathbf{n}$ be a multivariate generating function that converges in a neighborhood of the origin of $ℂ^d$. We present a new, multivariate method for computing the asymptotics of the diagonal coefficients $F_{a_1n,…,a_dn}$ and show its superiority over the standard, univariate diagonal method. Several examples are given in detail.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics for generalized Riordan arrays.\n \n \n \n \n\n\n \n\n\n\n In 2005 International Conference on Analysis of Algorithms, of Discrete Math. Theor. Comput. Sci. Proc., AD, pages 323-333 (electronic), 2005. Assoc. Discrete Math. Theor. Comput. Sci., Nancy\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@inproceedings {Wils2005,\n    AUTHOR = {Wilson, Mark C.},\n     TITLE = {Asymptotics for generalized {R}iordan arrays},\n BOOKTITLE = {2005 {I}nternational {C}onference on {A}nalysis of\n              {A}lgorithms},\n    SERIES = {Discrete Math. Theor. Comput. Sci. Proc., AD},\n     PAGES = {323-333 (electronic)},\n PUBLISHER = {Assoc. Discrete Math. Theor. Comput. Sci., Nancy},\n      YEAR = {2005},\n       keywords={ACSV theory},\n  url_Paper={https://dmtcs.episciences.org/3389/pdf},\n  abstract={The machinery of Riordan arrays has been used recently by several\nauthors. We show how meromorphic singularity analysis can be used to\nprovide uniform bivariate asymptotic expansions, in the central regime,\nfor a generalization of these arrays. We show how to do this\nsystematically, for various descriptions of the array. Several examples\nfrom recent literature are given.}\n }\n\n
\n
\n\n\n
\n The machinery of Riordan arrays has been used recently by several authors. We show how meromorphic singularity analysis can be used to provide uniform bivariate asymptotic expansions, in the central regime, for a generalization of these arrays. We show how to do this systematically, for various descriptions of the array. Several examples from recent literature are given.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Pemantle, R.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of multivariate sequences II: multiple points of the singular variety.\n \n \n \n \n\n\n \n\n\n\n Combinatorics, Probability and Computing, 13(4-5): 735-761. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{pemantle2004asymptotics,\n  title={Asymptotics of multivariate sequences II: multiple points of the singular variety},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={Combinatorics, Probability and Computing},\n  volume={13},\n  number={4-5},\n  pages={735-761},\n  year={2004},\n  publisher={Cambridge University Press},\n  keywords={ACSV theory},\n  url_Paper={https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/abs/asymptotics-of-multivariate-sequences-ii-multiple-points-of-the-singular-variety/F8B144EBED2754E43361A3BE4B0C3B01},\n  abstract={Let $F(\\b{z})=\\sum_\\b{r} a_\\b{r}\\b{z^r}$ be a multivariate  generating\nfunction which is meromorphic in some neighborhood of the origin of\n$\\mathbb{C}^d$, and let $\\mathcal{V}$ be its set of singularities.\nEffective asymptotic expansions for the coefficients can be obtained by\ncomplex contour integration near points of $\\mathcal{V}$. In the first\narticle in this series, we treated the case of smooth points  of\n$\\mathcal{V}$. In this article we deal with multiple points of\n$\\mathcal{V}$. Our results show that the central limit\n(Ornstein-Zernike) behavior typical of the smooth case does not hold in\nthe multiple point case. For example, when $\\mathcal{V}$ has a multiple\npoint singularity at $(1 , \\ldots , 1)$, rather than $a_\\b{r}$ decaying\nas $|\\b{r}|^{-1/2}$ as $|\\b{r}| \\to \\infty$, $a_\\b{r}$ is very nearly\npolynomial in a cone of directions.}\n}\n\n
\n
\n\n\n
\n Let $F(\\b{z})=∑_\\b{r} a_\\b{r}\\b{z^r}$ be a multivariate generating function which is meromorphic in some neighborhood of the origin of $ℂ^d$, and let $\\mathcal{V}$ be its set of singularities. Effective asymptotic expansions for the coefficients can be obtained by complex contour integration near points of $\\mathcal{V}$. In the first article in this series, we treated the case of smooth points of $\\mathcal{V}$. In this article we deal with multiple points of $\\mathcal{V}$. Our results show that the central limit (Ornstein-Zernike) behavior typical of the smooth case does not hold in the multiple point case. For example, when $\\mathcal{V}$ has a multiple point singularity at $(1 , … , 1)$, rather than $a_\\b{r}$ decaying as $|\\b{r}|^{-1/2}$ as $|\\b{r}| \\to ∞$, $a_\\b{r}$ is very nearly polynomial in a cone of directions.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Pemantle, R.; and Wilson, M. C.\n\n\n \n \n \n \n \n Asymptotics of multivariate sequences: I. smooth points of the singular variety.\n \n \n \n \n\n\n \n\n\n\n Journal of Combinatorial Theory, Series A, 97(1): 129-161. 2002.\n \n\n\n\n
\n\n\n\n \n \n \"Asymptotics paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@article{pemantle2002asymptotics,\n  title={Asymptotics of multivariate sequences: I. smooth points of the singular variety},\n  author={Pemantle, Robin and Wilson, Mark C.},\n  journal={Journal of Combinatorial Theory, Series A},\n  volume={97},\n  number={1},\n  pages={129-161},\n  year={2002},\n  publisher={Academic Press},\n  keywords={ACSV theory},\n  url_Paper={https://www.sciencedirect.com/science/article/pii/S0097316501932017},\n  abstract={Given a multivariate generating function $F(z_1 , \\ldots , z_d) = \\sum\na_{r_1 , \\ldots , r_d} z_1^{r_1} \\cdots z_d^{r_d}$, we determine\nasymptotics for the coefficients. Our approach is to use Cauchy's\nintegral formula near singular points of $F$, resulting in a tractable\noscillating integral. This paper treats the case where the singular\npoint of $F$ is a smooth point of a surface of poles. Companion papers G\ntreat singular points of $F$ where the local geometry is more\ncomplicated, and for which other methods of analysis are not known.}\n}\n\n
\n
\n\n\n
\n Given a multivariate generating function $F(z_1 , … , z_d) = ∑ a_{r_1 , … , r_d} z_1^{r_1} ⋯ z_d^{r_d}$, we determine asymptotics for the coefficients. Our approach is to use Cauchy's integral formula near singular points of $F$, resulting in a tractable oscillating integral. This paper treats the case where the singular point of $F$ is a smooth point of a surface of poles. Companion papers G treat singular points of $F$ where the local geometry is more complicated, and for which other methods of analysis are not known.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);