Manuel Lladser - Mixed Powers of Generating Functions

dmtcs:3501 - Discrete Mathematics & Theoretical Computer Science, January 1, 2006, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities - https://doi.org/10.46298/dmtcs.3501
Mixed Powers of Generating FunctionsConference paper

Authors: Manuel Lladser 1

  • 1 Department of Applied Mathematics [Boulder]

Given an integer m1, let be a norm in Rm+1 and let Sm+ denote the set of points d=(d0,,dm) in Rm+1 with nonnegative coordinates and such that d=1. Consider for each 1jm a function fj(z) that is analytic in an open neighborhood of the point z=0 in the complex plane and with possibly negative Taylor coefficients. Given n=(n0,,nm) in Zm+1 with nonnegative coordinates, we develop a method to systematically associate a parameter-varying integral to study the asymptotic behavior of the coefficient of zn0 of the Taylor series of mj=1{fj(z)}nj, as n. The associated parameter-varying integral has a phase term with well specified properties that make the asymptotic analysis of the integral amenable to saddle-point methods: for many dSm+, these methods ensure uniform asymptotic expansions for [zn0]mj=1{fj(z)}nj provided that n/n stays sufficiently close to d as n. Our method finds applications in studying the asymptotic behavior of the coefficients of a certain multivariable generating functions as well as in problems related to the Lagrange inversion formula for instance in the context random planar maps.


Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: Airy phenomena,asymptotic enumeration,analytic combinatorics,large powers of generating functions,discrete random structures,saddle point method,uniform asymptotic expansions,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

1 Document citing this article

Consultation statistics

This page has been seen 244 times.
This article's PDF has been downloaded 327 times.