相关论文: Asymptotics of sums of functions of primes located…

In this paper we consider asymptotic expansions for a class of sequences of symmetric functions of many variables. Applications to classical and free probability theory are discussed.

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…

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions.

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

We consider an estimation problem of expected functionals of a general random element that values in a metric space. If the functional forms an explicit function of some unknown parameters, we can estimate it by plugging-in a suitable…

If the prime numbers are pseudo-randomly distributed, then analogy with quantum systems suggests that counting primes might be modeled by a non-homogeneous Poisson process. Consequently, postulating underlying gamma statistics, more-or-less…

We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture…

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…

The paper considers a universal approach that allows one to quite simply obtain nonlinear asymptotic estimates of various summation functions. It is shown the application of this approach to the asymptotic estimation of divergent Dirichlet…

We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

In this paper, we study the asymptotic behavior of sums of functions of the increments of a given semimartingale, taken along a regular grid whose mesh goes to 0. The function of the $i$th increment may depend on the current time, and also…

Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…