Related papers: On the logarithmic factor in error term estimates …
In this article we provide examples, methods and algorithms to determine conditions on the parameters of certain type of parametric optimization problems, such that among the resulting local minima and maxima there is at least one which…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
In this paper we establish new integral representations for the remainder term of the known asymptotic expansion of the logarithm of the Barnes $G$-function. Using these representations, we obtain explicit and numerically computable error…
Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…
We develop novel techniques using abstract operator theory to obtain asymptotic formulae for lattice counting problems on infinite-volume hyperbolic manifolds, with error terms which are uniform as the lattice moves through "congruence"…
In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…
We give asymptotic expressions for the number of commuting matrices over finite fields. For this, we use product expansions for the corresponding generating functions.
We prove asymptotics for real moments of the logarithmic derivative of characteristic polynomials evaluated at $1-\frac{a}{N}$ in unitary, even orthogonal, and symplectic ensembles, where $a>0$ and $a=o(1)$ as the size $N$ of the matrix…
We study an asymptotic formula for counting integral points over an equation defined by a non-degenerated indefinite integral ternary quadratic form $f$ representing a non-zero integer $a$ such that $-a\cdot det(f)$ is square over a number…
We prove an asymptotic formula for the number of multi-quadratic number fields of bounded discriminant with a power-saving error term. Furthermore, we explicitly calculate the leading coefficient and extend our result to totally real…
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…
We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
We provide a complete combinatorial and asymptotic analysis of positive linear systems of equations in one catalytic variable that appear in several combinatorial problems such as in lattice path counting or stack-sortable permutation…
It is known that there is a one-to-one correspondence between equivalence classes of primitive indefinite binary quadratic forms and primitive hyperbolic conjugacy classes of the modular group. Due to such a correspondence, Sarnak obtained…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
In this paper, we provide explicit formulas, in terms of the covariances of sample covariances or sample correlations, for the asymptotic covariances of unrotated factor loading estimates and unique variance estimates. These estimates are…
In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…
We develop symbolic methods of asymptotic approximations for solutions of linear ordinary differential equations and use to them stabilize numerical calculations. Our method follows classical analysis for first-order systems and…