SearcharxivSearch

arXiv subjects

Berke Topacogullari

Publications and source records attributed to Berke Topacogullari.

5 recordsLinked to original sources

The fourth moment of individual Dirichlet L-functions on the critical line

We prove an asymptotic formula for the second moment of a product of two Dirichlet L-functions on the critical line, which has a power saving in the error term and which is uniform with respect to the involved Dirichlet characters. As special cases we give uniform asymptotic formulae for the fourth moment of individual Dirichlet L-functions and for the second moment of Dedekind zeta functions of quadratic number fields on the critical line.

math.NT

Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions

Given a multiplicative function $f$ which is periodic over the primes, we obtain a full asymptotic expansion for the shifted convolution sum $\sum_{|h|<n\leq x} f(n) τ(n-h)$, where $τ$ denotes the divisor function and $h\in\mathbb{Z}\setminus\{0\}$. We consider in particular the special cases where $f$ is the generalized divisor function $τ_z$ with $z\in\mathbb{C}$, and the characteristic function of sums of two squares (or more generally, ideal norms of abelian extensions). As another application, we deduce a full asymptotic expansion in the generalized Titchmarsh divisor problem $\sum_{|h|<n\leq x,\,ω(n)=k} τ(n-h)$, where $ω(n)$ counts the number of distinct prime divisors of $n$, thus extending a result of Fouvry and Bombieri-Friedlander-Iwaniec. We present two different proofs: The first relies on an effective combinatorial formula of Heath-Brown's type for the divisor function $τ_α$ with $α\in\mathbb{Q}$, and an interpolation argument in the $z$-variable for weighted mean values of $τ_z$. The second is based on an identity of Linnik type for $τ_z$ and the well-factorability of friable numbers.

math.NT

The shifted convolution of generalized divisor functions

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_k(n)$ and $d(n)$ with $k \geq 4$, which is uniform in the shift parameter and which has a power-saving error term, improving results obtained previously by Fouvry and Tenenbaum and, more recently, by Drappeau.

math.NT

On a certain additive divisor problem

We prove an asymptotic formula for a variant of the binary additive divisor problem with linear factors in the arguments, which has a power saving error term and which is uniform in all involved parameters.

math.NT

The Shifted Convolution of Divisor Functions

We prove an asymptotic formula for the shifted convolution of the divisor functions $d_3(n)$ and $d(n)$, which is uniform in the shift parameter and which has a power-saving error term. The method is also applied to give analogous estimates for the shifted convolution of $d_3(n)$ and Fourier coefficents of holomorphic cusp forms. These asymptotics improve previous results obtained by several different authors.

math.NT