Related papers: Vinogradov's mean value theorem via efficient cong…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo $2^t$. We derive a new bound on exponential sums with such sequences and use it to give estimate their discrepancy. The…

Let $G(k)$ denote the least number $s$ such that every sufficiently large natural number is the sum of at most $s$ positive integral $k$th powers. We show that $G(7)\le 31$, $G(8)\le 39$, $G(9)\le 47$, $G(10)\le 55$, $G(11)\le 63$,…

A result of Wright from 1937 shows that there are arbitrarily large natural numbers which cannot be represented as sums of $s$ $k$th powers of natural numbers which are constrained to lie within a narrow region. We show that the analogue of…

The natural sum operation for symplectic manifolds is defined by gluing along codimension two submanifolds. Specifically, let X be a symplectic 2n-manifold with a symplectic (2n-2)-submanifold V. Given a similar pair (Y,W) with a symplectic…

The primary objective of this paper is to employ methods from analytic number theory to investigate the mean value properties of a composite function involving the Dirichlet divisor function and a generalized minimal power function.…

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…

The aim of this work is to prove a Tauberian theorem for the Ingham summability method. The Tauberian theorem we prove is then applied to analyze asymptotics of mean values of multiplicative functions on natural numbers.

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…

Waring's problem has a long history in additive number theory. In its original form it deals with the representability of every positive integer as sum of $k$-th powers with integer $k$. Instead of these powers we deal with…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

Let $\Lambda(n)$ be the von Mangoldt function, $x$ real and $2\leq y \leq x$. This paper improves the estimate on the exponential sum over primes in short intervals \[ S_k(x,y;\alpha) = \sum_{x< n \leq x+y} \Lambda(n) e\left( n^k \alpha…

Let $s \geq 3$ be a natural number, let $\psi(x)$ be a polynomial with real coefficients and degree $d \geq 2$, and let $A$ be some large, non-empty, finite subset of real numbers. We use $E_{s,2}(A)$ to denote the number of solutions to…

n 1937 Ivan Vinogradov proved the three prime sum version of the Goldbach Conjecture, often called the weak form of Goldbach Conjecture. And that it holds for "sufficiently large" odd natural numbers. In this work we use Dirichlet Theorem,…

We discuss how one could study asymptotics of cyclotomic quantities via the mean values of certain multiplicative functions and their Dirichlet series using a theorem of Delange. We show how this could provide a new approach to Artin's…

We prove an asymptotic formula for the mean value of Frobenius numbers with three arguments. To prove this we use a new method invented by A. Ustinov, Rodseth's algorithm an bounds for exponential sums.

We characterize an asymptotic mean value formula in the viscosity sense for the double phase elliptic equation $$ -{\rm div}(\lvert \nabla u \rvert^{p-2}\nabla u+ a(x)\lvert\nabla u \rvert^{q-2}\nabla u)=0 $$ and the normalized double phase…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…