Related papers: On the logarithmic factor in error term estimates …
We introduce completely monotonic functions of order $r>0$ and show that the remainders in asymptotic expansions of the logarithm of Barnes double gamma function and Euler's gamma function give rise to completely monotonic functions of any…
A monotonicity approach to the study of the asymptotic behavior near corners of solutions to semilinear elliptic equations in domains with a conical boundary point is discussed. The presence of logarithms in the first term of the asymptotic…
An adjustable algorithm of exclusion of conditional equations with excessive residuals is proposed. The criteria applied in the algorithm use variable exclusion limits which decrease as the number of equations goes down. The algorithm is…
We construct several sequences of asymptotically optimal definite quadrature formulae of fourth order and evaluate their error constants. Besides the asymptotical optimality, an advantage of our quadrature formulae is the explicit form of…
We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…
This paper aims to derive explicit and computable error bounds for the asymptotic expansion of the Jacobi polynomials as their degree approaches infinity, using an integral method. The analysis focuses on the outer or oscillatory region of…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain…
We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are given as explicit exp-log expressions. We provide a method…
An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…
This paper reports on a new algorithm to compute the asymptotic solutions of a linear differential system. A feature of the algorithm is the ability to accommodate periodic coefficients.
We extend the asymptotic formula for counting integral matrices with a given irreducible characteristic polynomial by Eskin, Mozes and Shah in 1996 to the case of counting elements in a maximal order of certain central simple algebra with a…
Prior work on computable defect-based local error estimators for (linear) time-reversible integrators is extended to nonlinear and nonautonomous evolution equations. We prove that the asymptotic results from the linear case [W. Auzinger and…
We continue our study on the logarithmic balanced model metric initiated in our previous work. By a non-trivial refinement of the set of tools developed in our previous work, we are able to confirm partially a conjecture we made in our…
We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…
The subject of the article is linear systems of wave equations on cosmological backgrounds with convergent asymptotics. The condition of convergence corresponds to the requirement that the second fundamental form, when suitably normalised,…
Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…
We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the…
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of…
We give asymptotic formulas for the number of balanced words whose slope $\alpha$ and intercept $\rho$ lie in a prescribed rectangle. They are related to uniform distribution of Farey fractions and Riemann Hypothesis. In the general case,…
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.