Angel V. Kumchev, Lilu Zhao
Let $E(N)$ denote the number of positive integers $n \le N$, with $n \equiv 4 \pmod{24}$, which cannot be represented as the sum of four squares of primes. We establish that $E(N)\ll N^{11/32}$, thus improving on an earlier result of Harman and the first author, where the exponent $7/20$ appears in place of $11/32$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
We obtain a nontrivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short interval, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However the underlying technique is different and allows us to obtain nontrivial results starting from much shorter ranges.
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
Barban-Davenport-Halberstam type theorems for exponential sums and Piatetski-Shapiro primes
该研究在数论领域建立了三类Barban-Davenport-Halberstam型定理，分别适用于素数指数和、Piatetski-Shapiro素数及该类素数上的指数和，拓展了相关定理的应用范围。
We obtain new results on additive properties of the set $$ I^{-1}= \{x^{-1}: \quad x\in I\} $$ where $I$ is an arbitrary interval in the field of residue classes modulo a large prime $p$. We combine our results with multilinear exponential sum estimates and obtain new results on incomplete multilinear Kloosterman sums.
The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in this subset is constant and not equal to zero.
We prove two estimates for averages of sums of Kloosterman fractions over primes. The first of these improves previous results of Fouvry-Shparlinski and Baker.
This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums of functions of primes. Also, the necessary and sufficient conditions for the existence of these asymptotics are proved in the paper.
In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of these approximations
In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/γ}]$ with $\frac{865}{886}<γ< 1$.
In this note we study Kloosterman sums twisted by a multiplicative characters modulo a prime power. We show, by an elementary calculation, that these sums become equidistributed on the real line with respect to a suitable measure.
Let $γ<1<c$ and $19(c-1)+171(1-γ)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/γ}]$ in arithmetic progressions.
We obtain the general k-correlations for a short divisor sum related to primes.
Let $\mathbf H_2$ denote the set of even integers $n \not\equiv 1 \pmod 3$. We prove that when $H \ge X^{0.33}$, almost all integers $n \in \mathbf H_2$, $X < n \le X + H$ can be represented as the sum of a prime and the square of a prime. We also prove a similar result for sums of three squares of primes.
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order 2l^2 .
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression. Based on this distribution, a general formula was obtained for the asymptotic estimate of the sums of functions of primes, and also asymptotics was found for the sums of various functions of primes on a geometric progression. Several assertions about asymptotics of sums of functions of prime numbers on a geometric progression are proved. Necessary and sufficien…
We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{α,β}$, where $α>1$ is irrational and of finite type.
A survey paper on some recent results on additive problems with prime powers.
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.
Under the assumption of the Riemann Hypothesis (RH), we prove explicit quantitative relations between hypothetical error terms in the asymptotic formulae for truncated mean-square average of exponential sums over primes and in the mean-square of primes in short intervals. We also remark that such relations are connected with a more precise form of Montgomery's pair-correlation conjecture.
In this paper we study quadratic forms which are universal when restricted to almost prime inputs, establishing finiteness theorems akin to the Conway--Schneeberger 15 theorem.
On sums of two primes and six Fibonacci numbers
该研究运用圆法证明，足够大的正整数可表示为两个素数与六个斐波那契数之和、两个素数与七个卢卡斯数之和，还可表示为两个素数、三个斐波那契数与三个卢卡斯数之和。
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on Shparlinski's bound for exponential sums attached to certain recurrence sequences over finite fields.
We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some applications to primes in short intervals.
In this paper we prove a weighted sum formula for multiple harmonic sums modulo primes, thereby proving a weighted sum formula for finite multiple zeta values. Our proof utilizes difference equations for the generating series of multiple harmonic sums. We also conjecture several weighted sum formulas of similar flavor for finite multiple zeta values.
Quartic Gauss sums over primes and metaplectic theta functions
本文改进了四次高斯和的估计，并引入了新的数学工具，同时推测了相关矩的渐进行为。
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit new phenomena concerning Chebyshev-type biases of such sums when the number of irreducible factors is very large.
Bounds for moments of quadratic Dirichlet character sums of prime moduli
本文在广义黎曼假设下，先对模8p的二次Dirichlet L-函数平移矩建立精确上界，再据此证明素数模二次Dirichlet特征和矩的界。
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cramér's model as well. We also discuss generalizations to the Gaussian integers.
Character sums to prime power moduli evaluated at binary quadratic forms
研究素数幂模下二元二次型的特征和估计，采用p进分析方法，补充Heath-Brown对平方自由模的估计。
Problems 66 and 67 on sums of residue classes and primes of András Sárközy's collection of unsolved problems
本文讨论András Sárközy 2001年未解决问题集中的第66、67题，证明了素数稀疏子集和集的最优结果。
Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones previously known.
For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where $\text{Kl}_2(p;q)$ denotes a normalised Kloosterman sum with modulus $q$. This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Milićević showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bo…
In this paper we show that if $A$ is a subset of Chen primes with positive relative density $α$, then $A+A$ must have positive upper density at least $cαe^{-c^\prime\log(1/α)^{2/3}(\log\log(1/α))^{1/3}}$ in the natural numbers.
Corentin Perret-Gentil proved, under some very general conditions, that short sums of $\ell$-adic trace functions over finite fields of varying center converges in law to a Gaussian random variable or vector. The main inputs are P.~Deligne's equidistribution theorem, N.~Katz' works and the results surveyed in \cite{MR3338119}. In particular, this applies to $2$-dimensional Kloosterman sums $\mathsf{Kl}_{2,\mathbb{F}_q}$ studied by N.~Katz in \cite{MR955052} and in \cite{MR1081536} when the field $\mathbb{F}_q$ gets large. \par This article considers the case of short sums of normalized classic…
Sums of four generalized polygonal numbers of almost prime length
研究四类受限质数因子数的广义多边形数之和，证明大数可表示为此类和，参数限制最多988个质因子。
Matrix Kloosterman sums modulo prime powers
本文研究素数幂模的矩阵 Kloosterman 和，将既有素数模结果推广到素数幂情形，给出最优界，并指出其与 $\mathrm{GL}_n$ 上 horocyclic 流的联系。
Sums of products of Kloosterman sums to prime power moduli
本文针对素幂模下的Kloosterman和乘积和，证明了新的强幂节省界，通过利用p进可微性的初始项估计完全指数和的方法实现，为相关数论问题提供了量化的对齐分析。
Shifted bilinear sums of Salié sums and the distribution of modular square roots of shifted primes
研究Salié和的移位双线性和的上界，并分析移位素数的模平方根分布，揭示$b\not \equiv 0 \bmod q$时的新困难。
A conditional result on exponential sums over primes in short intervals
本文在广义 Riemann 假设及 Dirichlet L 函数密度假设同时成立的条件下，给出短区间中素数指数和的一个条件性结果。
Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors an analogous result by Friedlander-Goldston.
For arbitrary $c_0>0$, if $A$ is a subset of the primes less than $x$ with cardinality $δx (\log x)^{-1}$ with $δ\geq (\log x)^{-c_0}$, then there exists a positive constant $c$ such that the cardinality of $A+A$ is larger than $c\, δx (\log\log x)^{-1}$.
We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} χ(x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} χ_1 (x)χ_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for $m\geq 2$ if $p\nmid ABk$).
For integer $q$, let $χ$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}Λ(n)χ(n+a),$$ where $Λ(n)$ is the von Mangoldt function. This bound improves and extends the range of a result of Friedlander, Gong and Shparlinski
Let $\mathcal{A}'$ be the set of integers missing any three fixed digits from their decimal expansion. We produce primes in a thin sequence by proving an asymptotic formula for counting primes of the form $p = m^2 + \ell^2$, with $\ell \in \mathcal{A}'$. The proof draws on ideas from the work of Friedlander-Iwaniec on primes of the form $p = x^2+y^4$, as well as ideas from the work of Maynard on primes with restricted digits.
In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious oversight in our first paper, but make further progress on the exponential sums estimates needed, together with an embellishment of the previous sieve technique employed. This leads to an improvement in our bounds for the maximal size of the exceptional sets.
We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a bound given by Balog, Rivat and Sárközy.
A Density Theorem for Higher Order Sums of Prime Numbers
该研究证明下密度严格大于1/2的素数子集可表所有充分大偶数为其4个素数之和，还推广到k≥4个加项及k≥4个不同素数子集的情形，以初等组合引理为核心新贡献，延伸了此前的两、三素数和相关研究。
We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K. Matomäki, replacing 10 by 23, 18 and 15, respectively. The method combines the Selberg sieve, equidistribution of Kloosterman sums and spectral theory of automorphic forms.
Exploring the Representation of Large Positive Integers as Sums of Prime Powers and Integer Powers: Analysis with Positive Density Subsets
本文利用转换原理研究大正整数表示为素数幂与整数幂之和的问题，其中素数和整数幂分别取自正密度子集，拓展了加法数论中的表示理论。
On sums of unequal powers of primes and powers of 2
本文证明了充分大的偶数可表示为素数平方、立方、四次方及2的幂之和，且至少5.313%的奇数可表示为素数平方、立方与四次方之和，改进了R. Zhang的结果。
We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems of congruences. The first is related to Vinogradov's mean value theorem, although the second does not appear to have been considered before. Our bound improves on current results in the range $N\ge q^{2k^{-1/2}+O(k^{-3/2})}$.
Computational results on sums of a prime with squares or cubes
本文通过计算验证了素数加两个平方数或立方数的表示猜想，证明了特定范围内所有整数均可表示，并利用椭圆曲线整点方法实现。
On certain sums over primes and the Riesz function
本文通过Gram级数导数与里斯函数的关系，探讨素数求和近似中的Mobius函数级数，推导出一般积分关系。
Real exponential sums over primes and prime gaps
研究证明在短区间内存在素数，解决了长期存在的问题，并验证了关于素数分布的旧猜想。
If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$ and $\ell \geq 2$. Our proof relies upon Frey-Hellegouarch curves and results on supersingular primes for elliptic curves without complex multiplication, derived from upper bounds for short character sums and sieves, analytic and combinatorial.
Almost primes and primes that are sums of two squares plus 1
该研究用向量筛框架（含半线性筛、线性筛）得出满足p-1为两平方和且p+2素因子个数有界的素数p≤x的下界。
Prime Solutions to a Binary Additive Equation and Mixed Moments of Character Sums
本文通过泊松求和与Kloosterman分数和均值估计，得到二元加法方程素数解的渐近公式，并应用于特征和混合四阶矩，获得非平凡界。
We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $π(n)$, the prime-counting function. We also obtain that $π(n) \sim n a_n$ and we estimate $\frac{1}{a_n}-\frac{n}{π(n)}$ showing that $\lim_{n \rightarrow \infty} \frac{1}{a_n}-\frac{n}{π(n)}$ is convergent.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。