English
Related papers

Related papers: Asymptotic Formulae for Mixed Congruence Stacks

200 papers

Using the steepest descent method for oscillatory Riemann-Hilbert problems introduced by Deift and Zhou [Ann. Math. {\bf 137}(1993), 295-368], we derive asymptotic formulas for the Meixner polynomials in two regions of the complex plane…

Classical Analysis and ODEs · Mathematics 2015-03-17 X. -S. Wang , R. Wong

Using a variational approach, two new series representations for the incomplete Gamma function are derived: the first is an asymptotic series, which contains and improves over the standard asymptotic expansion; the second is a uniformly…

Mathematical Physics · Physics 2009-11-11 Paolo Amore

We develop the theory of a new type of asymptotic expansions for functions of two variables the coefficients of which contain functions of one of the variables as well as functions of the quotient of these two variables. These combined…

Dynamical Systems · Mathematics 2010-04-30 Augustin Fruchard , Reinhard Schäfke

We develop the theory of a new type of asymptotic expansions for functions of two variables the coefficients of which contain functions of one of the variables as well as functions of the quotient of these two variables. These combined…

Dynamical Systems · Mathematics 2010-03-23 Augustin Fruchard , Reinhard Schäfke

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

Number Theory · Mathematics 2007-08-07 Kathrin Bringmann

A previous paper by the authors found explicit contour integral formulas for certain joint moments of the multi-species q-TAZRP (totally asymmetric zero range process), using algebraic methods. These contour integral formulas have a…

Probability · Mathematics 2024-03-14 Jeffrey Kuan , Zhengye Zhou

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

Number Theory · Mathematics 2025-03-12 Michael Coons , Simon Kristensen , Mathias L. Laursen

By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in…

Classical Analysis and ODEs · Mathematics 2015-11-25 Karen Ogilvie , Adri B. Olde Daalhuis

We construct asymptotic expansions for ordinary differential equations with highly oscillatory forcing terms, focussing on the case of multiple, non-commensurate frequencies. We derive an asymptotic expansion in inverse powers of the…

Numerical Analysis · Mathematics 2023-07-19 Marissa Condon , Alfredo Deano , Jing Gao , Arieh Iserles

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

Combinatorics · Mathematics 2024-01-02 Thierry Monteil , Khaydar Nurligareev

In this work is presented a study on matrix biorthogonal polynomials sequences that satisfy a nonsymmetric recurrence relation with unbounded coefficients. The ratio asymptotic for this family of matrix biorthogonal polynomials is derived…

Classical Analysis and ODEs · Mathematics 2017-10-05 Amilcar Branquinho , Juan Carlos García-Ardila , Francisco Marcellán

In this paper we give an asymptotic expansion including error terms for the number of cycles in homology classes for connected graphs. Mainly, we obtain formulae about the coefficients of error terms which depend on the homology classes and…

Mathematical Physics · Physics 2009-11-10 Dongsheng Liu

Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…

Combinatorics · Mathematics 2025-08-28 Carine Pivoteau , Bruno Salvy

We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…

Number Theory · Mathematics 2020-11-10 Walter Bridges

A novel method of summing asymptotic series is advanced. Such series repeatedly arise when employing perturbation theory in powers of a small parameter for complicated problems of condensed matter physics, statistical physics, and various…

Mathematical Physics · Physics 2015-06-12 S. Gluzman , V. I. Yukalov

Andrews-Dyson-Hickerson, Cohen build a striking relation between q-hypergeometric series, real quadratic fields, and Maass forms. Thanks to the works of Lewis-Zagier and Zwegers we have a complete understanding on the part of these…

Number Theory · Mathematics 2025-02-28 Kathrin Bringmann , William Craig , Caner Nazaroglu

Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves…

Number Theory · Mathematics 2021-04-06 Nian Hong Zhou

Let $M$ be a closed Riemannian manifold carrying an effective and isometric action of a compact connected Lie group $G$. We derive a refined remainder estimate in the stationary phase approximation of certain oscillatory integrals on…

Spectral Theory · Mathematics 2015-09-03 Pablo Ramacher

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

Combinatorics · Mathematics 2018-10-12 Elie de Panafieu

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…

Combinatorics · Mathematics 2011-05-18 Xavier Perez-Gimenez , Nicholas Wormald