Related papers: A new method for computing asymptotics of diagonal…

We investigate depoissonization, the problem of recovering asymptotics of sequence coefficients from their exponential generating function. Classical approaches rely on complex-analytic growth conditions, but here we develop real-variable…

Nonparametric estimators of a regression function with circular response and Rd-valued predictor are considered in this work. Local polynomial type estimators are proposed and studied. Expressions for their asymptotic biases and variances…

We consider orthogonal polynomials $\{p_{n,N}(x)\}_{n=0}^{\infty}$ on the real line with respect to a weight $w(x)=e^{-NV(x)}$ and in particular the asymptotic behaviour of the coefficients $a_{n,N}$ and $b_{n,N}$ in the three term…

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…

Asymptotic expansions for generalised trigonometric integrals are obtained in terms of elementary functions, which are valid for large values of the parameter $a$ and unbounded complex values of the argument. These follow from new…

We consider the uniform asymptotic expansion for the Gauss hypergeometric function \[F(a+\epsilon\lambda,m;c+\lambda;x),\qquad \lambda\to+\infty\] for $x<1$ and positive integer $m$ when the parameter $\epsilon>1$ and the constants $a$ and…

This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…

We consider a well known model of random directed acyclic graphs of order $n$, obtained by recursively adding vertices, where each new vertex has a fixed outdegree $d\ge2$ and the endpoints of the $d$ edges from it are chosen uniformly at…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…

We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials under the condition that the recurrence coefficients in the nearest neighbor recurrence relations converge.

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…

Let $\pi$ be a unitary automorphic cuspidal representation of $GL_2(\mathbb{Q}_\mathbb{A})$ with Fourier coefficients $\lambda_\pi(n)$. Asymptotic expansions of certain sums of $\lambda_\pi(n)$ are proved using known functorial liftings…

We study asymptotic expansion as $\nu\to0$ for integrals over ${ \mathbb{R} }^{2d}=\{(x,y)\}$ of quotients $F(x,y) \big/ \big( (x\cdot y)^2+(\nu \Gamma(x,y))^2\big)^{-1}$, where $\Gamma$ is strictly positive and $F$ decays at infinity…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

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…

For a function g(w) analytic and univalent in {w:1<|w|<\infty} with a simple pole at \infty and a continuous extension to {w:|w|\geq 1}, we consider the Faber polynomials F_n(z), n=0,1,2,..., associated to g(w) via their generating function…

This paper introduces a novel algorithmic solution for the approximation of a given multivariate function by a nomographic function that is composed of a one-dimensional continuous and monotone outer function and a sum of univariate…

A new approach to the problem of finding the asymptotical behaviour of large orders of semiclassical expansion is suggested. Asymptotics of high orders not only for eigenvalues, but also for eigenfunctions, are constructed. Thus, one can…