Related papers: Multiplicative functions in short intervals II

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed…

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

We prove an analogue of the Prime Number Theorem for short intervals on a smooth projective geometrically irreducible curve of arbitrary genus over a finite field. A short interval "of size E" in this setting is any additive translate of…

We decrease the length of the shortest interval for which almost all even integers in it are the sum of two primes. This is achieved by applying a version of the Circle Method that uses two minorants together with a nonnegative model for…

Function values are, in some sense, "almost as good" as general linear information for $L_2$-approximation (optimal recovery, data assimilation) of functions from a reproducing kernel Hilbert space. This was recently proved by new upper…

Hooley conjectured that the variance V(x;q) of the distribution of primes up to x in the arithmetic progressions modulo q is asymptotically x log q, in some unspecified range of q\leq x. On average over 1\leq q \leq Q, this conjecture is…

We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]\to S^1$. In contrast to the number field setting, the characterization depends crucially on whether the notion of discrepancy is defined…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.

For large enough (but fixed) prime powers $q$, and trace functions to squarefree moduli in $\mathbb{F}_q[u]$ with slopes at most $1$ at infinity, and no Artin--Schreier factors in their geometric global monodromy, we come close to…

In this note, we generalise two results on prime numbers in short intervals. The first result is Ingham's theorem which connects the zero-density estimates with short intervals where the prime number theorem holds, and the second result is…

We prove a uniform estimate for sums of Hecke--Maass eigenvalues squared over primes in short intervals that can be regarded as an analogue of Hoheisel's classical prime number theorem for all real analytic cusp forms. Our argument is…

We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in the uniform norm. Our main interest is to obtain preasymptotic estimates for the corresponding sampling numbers. We obtain results in terms of the…

Using estimates on Hooley's $\Delta$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

For "almost all" sufficiently large $N,$ satisfying necessary congruence conditions and $k\geq 2$, we show that there is an {\bf asymptotic formula} for the number of solutions of the equation \begin{align*} \begin{split}…

We prove that analogues of the Hardy-Littlewood generalised twin prime conjecture for almost primes hold on average. Our main theorem establishes an asymptotic formula for the number of integers $n=p_1p_2 \leq X$ such that $n+h$ is a…