Asymptotic formulas for certain arithmetic functions

This is an extended summary of a talk given by the last named author at the Czecho-Slovake Number Theory Conference 2005, held at Malenovice in September 2005. It surveys some recent results concerning asymptotics for a class of arithmetic functions, including, e.g., the second moments of the number-of-divisors function d(n) and of the function r(n) which counts the number of ways to write a positive integer as a sum of two squares. For the proofs, reference is made to original articles by the authors published elsewhere. The last named author gratefully acknowledges support from the Austrian Science Fund (FWF) under project Nr. P18079-N12.     

On the local distribution of certain arithmetic functions

Let d(n), σ ₁(n), and φ(n) stand for the number of positive divisors of n, the sum of the positive divisors of n, and Euler’s function, respectively. For each ν ∈, Z, we obtain asymptotic formulas for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd integer m as well as for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd rational number r. Our method also applies when φ(n) is replaced by σ ₁(n), thus, improving upon an earlier result of Bateman, Erdős, Pomerance, and Straus, according to which the set of integers n such that is an integer is of density 1/2. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 315–331, July–September, 2006.     

On certain arithmetic functions involving the greatest common divisor

The paper deals with asymptotics for a class of arithmetic functions which describe the value distribution of the greatest-common-divisor function. Typically, they are generated by a Dirichlet series whose analytic behavior is determined by the factor ζ²(s)ζ(2s − 1). Furthermore, multivariate generalizations are considered.     

Estimates in the invariance principle in terms of truncated power moments

We obtain estimates for the distributions of errors which arise in approximation of a random polygonal line by a Wiener process on the same probability space. The polygonal line is constructed on the whole axis for sums of independent nonidentically distributed random variables and the distance between it and the Wiener process is taken to be the uniform distance with an increasing weight. All estimates depend explicitly on truncated power moments of the random variables which is an advantage over the earlier estimates of Komlos, Major, and Tusnady where this dependence was implicit.     

On locally repeated values of certain arithmetic functions,I

Let ν(n) denote the number of distinct prime factors of n. We show that the equation n + ν(n) = m + ν(m) has many solutions with n ≠ m. We also show that if ν is replaced by an arbitrary, integer-valued function f with certain properties assumed about its average order, then the equation n + f(n) = m + f(m) has infinitely many solutions with n ≠ m.     

On the oscillatory behavior of certain arithmetic functions associated with automorphic forms

We establish the oscillatory behavior of several significant classes of arithmetic functions that arise (at least presumably) in the study of automorphic forms. Specifically, we examine general L-functions conjectured to satisfy the Grand Riemann Hypothesis, Dirichlet series associated with classical entire forms of real weight and multiplier system, Rankin-Selberg convolutions (both “naive” and “modified”), and spinor zeta-functions of Hecke eigenforms on the Siegel modular group of genus two. For the second class we extend results obtained previously and jointly by M. Knopp, W. Kohnen, and the author, whereas for the fourth class we provide a new proof of a relatively recent result of W. Kohnen.     

Generating functions for newton-cotes formulae weights and error terms

From the observation that weights in the Newton-Cotes formulae look like integrals of binomial coefficient polynomials, we are able to evaluate their generating function. We also obtain a generating function for the error terms in the Newton-Cotes formulae by generalizing the Euler-Maclaurin sum formula.     

Smoothing arithmetic error terms: the case of the Euler φ function

In many cases known methods of detecting oscillations of arithmetic error terms involve certain smoothing pro‐cedures. Usually an application of the smoothing operator does not change significantly the order of magnitude of the error under consideration. This is so for instance in the case of the classical error terms known in the prime number theory. The main purpose of this paper is to show that the situation for primes is not general. Considering the error term in the asymptotic formula for the Euler totient function we show that just one application of an integral smoothing operator changes situation dramatically: the order of magnitude of drops from x to √x (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Moments of the probability density functions of error terms in divisor problems

We derive an explicit formula for the moments of the probability density function of a class of functions. An application of this shows that the density function of the error term in the Pilz divisor problem is asymmetric.

     

Quadrature formulas with minimum error for certain classes of functions

Problems connected with optimum quadrature formulas for the function classes H and H ⁿ are investigated.Translated from Matematicheskie Zametki, Vol. 3, No. 5, pp. 577–586, May, 1968.     

On the error of multidimensional quadrature formulas for certain classes of functions

We obtain regular (with respect to the power scale) estimates of the errors of multidimensional optimal quadrature formulas in spaces of periodic functions with constraints on Fourier coefficients in the ? _p -norm for 1 < p < 2.     

On the Rankin-Selberg problem: higher power moments of the Riesz mean error term

LetΔ_1(x;φ) be the error term of the first Riesz mean of the Rankin-Selberg problem. We study the higher power moments ofΔ_1(x;φ) and derive an asymptotic formula for the 3-rd, 4-th and 5-th power moments by using Ivic's large value arguments and other techniques.     

On the distribution of the roots of certain congruences and a problem for additive arithmetic functions

The asymptotic distribution of the roots of the congruence ax ≡ b (mod D), 1 ≤ x ≤ D, as D varies, is investigated. Quantitative estimates are obtained by means of exponential sums combined with sieve methods. As an application of the results it is shown that if an additive arithmetic function satisfies f(an + b) ? f(cn + d) = O(1) for all positive integers n, ad ≠ bc, then f(n) = O((log n)³) must hold. This result is apparently the first bound of any kind in such a situation.