AbstractWe consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic to a nondegenerate quadratic. We compute the asymptotics of the coefficients of such a generating function. The computation requires some topological deformations as well as Fourier–Laplace transforms of generalized functions. We apply the results of the theory to specific combinatorial problems, such as Aztec diamond tilings, cube groves, and multi-set permutations
International audienceWe consider the enumeration of walks on the two-dimensional non-negative integ...
AbstractBender–Canfield showed that a plethora of graph counting problems in orientable/non-orientab...
The field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through anal...
AbstractWe consider a number of combinatorial problems in which rational generating functions may be...
Let F be the quotient of an analytic function with a product of linear functions. Working in the fra...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
International audienceIn this paper, we use the multivariate analytic techniques of Pemantle and Wil...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
AbstractGiven a multivariate generating function F(z1, …, zd)=∑ar1, …, rdzr11…zrdd, we determine asy...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
An algorithm for bivariate singularity analysis is developed. For a wide class of bivariate, rationa...
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of pos...
The ring of polynomials over a finite field has many arithmetic properties similar to those of the r...
AbstractLet a multivariate sequence an(k) ⩾ 0 be given. Multivariate central and local limit theorem...
An algorithm for bivariate singularity analysis is developed. For a wide class of bivariate, rationa...
International audienceWe consider the enumeration of walks on the two-dimensional non-negative integ...
AbstractBender–Canfield showed that a plethora of graph counting problems in orientable/non-orientab...
The field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through anal...
AbstractWe consider a number of combinatorial problems in which rational generating functions may be...
Let F be the quotient of an analytic function with a product of linear functions. Working in the fra...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
International audienceIn this paper, we use the multivariate analytic techniques of Pemantle and Wil...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
AbstractGiven a multivariate generating function F(z1, …, zd)=∑ar1, …, rdzr11…zrdd, we determine asy...
Flajolet and Odlyzko (1990) derived asymptotic formulae the coefficients of a class of uni- variate ...
An algorithm for bivariate singularity analysis is developed. For a wide class of bivariate, rationa...
Our main results are asymptotic zero-one laws satisfied by the diagrams of unimodal sequences of pos...
The ring of polynomials over a finite field has many arithmetic properties similar to those of the r...
AbstractLet a multivariate sequence an(k) ⩾ 0 be given. Multivariate central and local limit theorem...
An algorithm for bivariate singularity analysis is developed. For a wide class of bivariate, rationa...
International audienceWe consider the enumeration of walks on the two-dimensional non-negative integ...
AbstractBender–Canfield showed that a plethora of graph counting problems in orientable/non-orientab...
The field of analytic combinatorics, which studies the asymptotic behaviour ofsequences through anal...