Related papers: Ces\`aro averages for Goldbach representations wit…

We prove the following result: Let $N \geq 2$ and assume the Riemann Hypothesis (RH) holds. Then \[ \sum_{n=1}^{N} R(n) =\frac{N^{2}}{2} -2 \sum_{\rho} \frac{N^{\rho + 1}}{\rho (\rho + 1)} + O(N \log^{3}N), \] where $\rho=1/2+i\gamma$ runs…

We study the probabilistic behavior of sums of Fourier coefficients in arithmetic progressions. We prove a result analogous to previous work of Fouvry-Ganguly-Kowalski-Michel and Kowalski-Ricotta in the context of half-integral weight…

Let $\Lambda$ be the von Mangoldt function and $(r_G(n) = \sum_{m_1 + m_2 = n} \Lambda(m_1) \Lambda(m_2))$ be the counting function for the Goldbach numbers. Let $N \geq 2$ be an integer. We prove that $$\begin{align} &\sum_{n \le N} r_G(n)…

We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

For every even integer N, denote by D_{1,2}(N) the number of representations of N as a sum of a prime and an integer having at most two prime factors. In this paper, we give a new lower bound for D_{1,2}(N).

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…

We introduce a simple and straight-forward averaging procedure, which is a generalization of one which is commonly used in electrodynamics, and show that it possesses all the characteristics we require for linearized averaging in general…

In this paper, we improve the moment estimates for the gaps between numbers that can be represented as a sum of two squares of integers. We consider certain sum of Bessel functions and prove the upper bound for its weighted mean value. This…

The binary problem of Goldbach is solved by the method of the trigonometrical sums. The asymptotic formula of distribution of the even numbers formed by the sum of two simple uneven numbers is found for each even number from the set of…

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers.…

We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $\omega \subset \mathbb{T}$. There is an integer $N_\omega $, so that every odd integer $n$ with $N(n)>N_\omega $ and $\text{dist}(…

For a wide range of functions $W\colon\mathbb{N}\to\mathbb{N}$, we establish a general result for estimating weighted averages of the form \[ \mathbb{E}^{W}_{n \le N} f(\vartheta(n))= \frac{1}{W(N)}\sum_{n=1}^N (W(n)-W(n-1))f(\vartheta(n)),…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

We give an asymptotic formula for the mean value of the number of representations of an integer as sum of two squares known as the Gauss circle problem.

We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.

A general method to combine several estimators of the same quantity is investigated. In the spirit of model and forecast averaging, the final estimator is computed as a weighted average of the initial ones, where the weights are constrained…