Search arXivSearch

arXiv · math/0604152

Uniform formulae for coefficients of meromorphic functions in two variables. Part I

Abstract

Uniform asymptotic formulae for arrays of complex numbers of the form $(f_{r,s})$, with $r$ and $s$ nonnegative integers, are provided as $r$ and $s$ converge to infinity at a comparable rate. Our analysis is restricted to the case in which the generating function $F(z,w):=\sum f_{r,s} z^r w^s$ is meromorphic in a neighborhood of the origin. We provide uniform asymptotic formulae for the coefficients $f_{r,s}$ along directions in the $(r,s)$-lattice determined by regular points of the singular variety of $F$. Our main result derives from the analysis of a one dimensional parameter-varying integral describing the asymptotic behavior of $f_{r,s}$. We specifically consider the case in which the phase term of this integral has a unique stationary point, however, allowing the possibility that one or more stationary points of the amplitude term coalesce with this. Our results find direct application in certain problems associated to the Lagrange inversion formula as well as bivariate generating functions of the form $v(z)/(1-w\cdot u(z))$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Lladser. 2006-04-06. Uniform formulae for coefficients of meromorphic functions in two variables. Part I. https://arxiv.org/abs/math/0604152

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO