T. D. Browning
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We analyze certain bilinear forms involving $GL_3$ Kloosterman sums. As an application, we obtain an improved estimate for the $GL_3$ spectral large sieve inequality.
We prove best-possible bounds for bilinear forms in Kloosterman sums for GL(3) associated with the long Weyl element. As an application we derive a best-possible spectral large sieve inequality on GL(3).
By using a variant of Kowalski's large sieve for Frobenius in compatible systems, we obtain zero-density estimates for arguments of $\ell$-adic trace functions over finite fields with values in some algebraic subsets of the cyclotomic integers, when the monodromy groups are known. This applies in particular to hyper-Kloosterman sums and general exponential sums considered by Katz.
We study the average size of shifted convolution summation terms related to the problem of Quantum Unique Ergodicity on ${\rm SL}_2 (\mathbbm{Z})\backslash \mathbbm{H}$. Establishing an upper-bound sieve method for handling such sums, we achieve an unconditional result which suggests that the average size of the summation terms should be sufficient in application to Quantum Unique Ergodicity. In other words, cancellations among the summation terms, although welcomed, may not be required. Furthermore, the sieve method may be applied to shifted sums of other multiplicative functions with similar…
The method of proof of Balog and Ruzsa and the large sieve of Linnik are used to investigate the behaviour of the $L^{1}$ norm of a wide class of exponential sums over the square-free integers and the primes. Further, a new proof of the lower bound due to Vaughan for the $L^{1}$ norm of an exponential sum with the von Mangoldt $Λ$ function over the primes is furnished. Ramanujan's sum arises naturally in the proof, which also employs Linnik's large sieve.
The large sieve inequality and additive decompositions of sums of squares
该研究基于大筛法证明了针对缺失素数模平方剩余类集合的新筛法估计，将其应用于Ostmann问题，得出平方和的非平凡和集分解需由大小相近的两个集合构成的结论。
Selberg sieve weights and sign changes of Kloosterman sums. II. Square-free moduli with at most four prime factors
本文证明对每个符号，存在大量（\\(\gg X/\log X\\)）至多四个素因子的无平方因子模\\(q\\)，其归一化Kloosterman和取该符号，方法结合Selberg筛与等分布及均方估计。
Let $f\in\mathbb{Z}[T]$ be any polynomial of degree $d>1$ and $F\in\mathbb{Z}[X_{0},...,X_{n}]$ an irreducible homogeneous polynomial of degree $e>1$ such that the projective hypersurface $V(F)$ is smooth. In this paper we give a bound for \[ N(f,F,B):=|\{\textbf{x}\in\mathbb{Z}^{n+1}:\max_{0\leq i\leq n}|x_{i}|\leq B,\exists t\in\mathbb{Z}\text{ such that }f(t)=F(\textbf{x})\}|, \] To do this, we introduce a generalization of the Heath-Brown and Munshi's power sieve and we extend two results by Deligne and Katz on estimates for additive and multiplicative characters in many variables.
We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erdös and Renyi.
Horizontal moments of Kloosterman sums and a density version of sieves
本研究针对模$n$的标准Kloosterman和，研究其关于$n\leqslant X$的平均矩，得到了和的水平矩渐近估计，通过构造特殊模族结合筛法密度版本与Sato--Tate分布完成上下界证明。
Almost primes and primes that are sums of two squares plus 1
该研究用向量筛框架（含半线性筛、线性筛）得出满足p-1为两平方和且p+2素因子个数有界的素数p≤x的下界。
In this paper, we investigate the asymptotics of a class of weighted sums over multiplicative functions and apply our results to deduce a stronger asymptotic form of Yitang Zhang's smoothened GPY sieve with coefficient expressions that are friendly to numerical computations.
Selberg sieve weights and sign changes of Kloosterman sums. I. Uniform asymptotics for shifted weights
本文证明带二次截断函数的除数和关联的均匀渐近公式，误差为O_g(Y/(log Y)^2)，主项为导数双线性形式，为Kloosterman和符号变化问题提供关键估计。
Large sieve inequality for sums of Legendre symbols over short intervals
本文利用Burgess界和Selberg筛法，研究Legendre符号在短区间上的二次矩界，并在特定条件下获得对h的幂次改进。
We obtain asymptotic formulas for the $2k$th moments of partially smoothed divisor sums of the Möbius function. When $2k$ is small compared with $A$, the level of smoothing, then the main contribution to the moments come from integers with only large prime factors, as one would hope for in sieve weights. However if $2k$ is any larger, compared with $A$, then the main contribution to the moments come from integers with quite a few prime factors, which is not the intention when designing sieve weights. The threshold for "small" occurs when $A=\frac 1{2k} \binom{2k}{k}-1$. One can ask analogous q…
An improved large sieve for quadratic characters via Hooley neutralisers and its applications
本文结合Hooley neutralisers与二次特征的大筛法，改进了该筛法，并成功应用于具有双曲高度条件的特征和问题。
Partial Liouville sums over divisors
本文运用筛法与初等变换，证明了刘维尔函数在除数上的部分和符号具有强意义下的均匀分布性质。
We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,χ)$ of moduli $q$ and primitive characters $χ$ modulo $q$, for which the corresponding character sums with smooth numbers are large.
We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions $a, b \in \mathbb N$ to the equations $a+b=n$ and $a-b=n$, where $a$ is $k$-free and $b$ is $l$-free. This is the first time that this problem has been studied with distinct powers $k$ and $l$.
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.
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.
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 study an instance of the Affine Sieve, producing a level of distribution beyond that which can be obtained from current techniques, even assuming a Selberg/Ramanujan-type spectral gap. In particular, we consider the set of hypotenuses in a thin orbit of Pythagorean triples. Previous work [Kon07, Kon09, KO12] gave an exponent of distribution alpha < 1/12 coming from Gamburd's [Gam02] gap theta = 5/6, thereby producing R = 13 almost primes in this linear sieve problem (see Sec. 1 for definitions). If conditioned on a best possible gap theta = 1/2, the known method would give an exponent alpha…
We prove new bounds for weighted mean values of sums involving Fourier coefficients of cusp forms that are automorphic with respect to a Hecke congruence subgroup Γ=Γ_0(q) of the group SL(2,Z[i]), and correspond to exceptional eigenvalues of the Laplace operator on the space L^2(Γ\SL(2,C)/SU(2)). These results are, for certain applications, an effective substitute for the generalised Selberg eigenvalue conjecture. We give a proof of one such application, which is an upper bound for a sum of generalised Kloosterman sums (of significance in the study of certain mean values of Hecke zeta-function…
By elaborating a two-dimensional Selberg sieve with asymptotics and equidistributions of Kloosterman sums from $\ell$-adic cohomology, as well as a Bombieri--Vinogradov type mean value theorem for Kloosterman sums in arithmetic progressions, it is proved that for any given primitive Hecke--Maass cusp form of trivial nebentypus, the eigenvalue of the $n$-th Hecke operator does not coincide with the Kloosterman sum $\mathrm{Kl}(1,n)$ for infinitely many squarefree $n$ with at most $100$ prime factors. This provides a partial negative answer to a problem of Katz on modular structures of Kloosterm…
We prove that $164634913$ is the smallest positive integer that is a sum of two rational sixth powers but not a sum of two integer sixth powers. If $C_{k}$ is the curve $x^{6} + y^{6} = k$, we use the existence of morphisms from $C_{k}$ to elliptic curves, together with the Mordell-Weil sieve, to rule out the existence of rational points on $C_{k}$ for various $k$.
Primes with a missing digit: distribution in arithmetic progressions and an application in sieve theory
本文利用圆法证明了缺失一位数字的素数的Bombieri-Vinogradov型定理，并结合半线性筛，给出了形如p=1+m^2+n^2的此类素数数量的正确数量级上下界。
Large sieve inequalities with power moduli and Waring's problem
本文通过将大筛法不等式与华林问题的受限变体关联，并利用经典除数界和 Wooley 的指数和均值结果，改进了所有 k≥4 情形下带 k 次幂模的大筛法不等式，同时给出了基于 Hardy-Littlewood 猜想公式的条件性结果。
Smooth Subsum Search: A heuristic for practical integer factorization
本文提出一种基于可被因子基素数整除的和来表示平滑性候选的整数分解启发式方法，其Python实现比最快的自初始化二次筛法快5至10倍。
Higher rank elliptic sieve via CM endomorphisms
本文针对带复乘的椭圆曲线，将椭圆筛法应用于椭圆网，证明几乎所有非挠点倍点的y坐标不属于阿贝尔扩张的范数群，拓展了椭圆筛法的应用场景。
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 proofs both build on the recently proved main conjecture for Vinogradov's mean value theorem. We present two selected applications: First, we prove a new $k$- th derivative test for the number of integer points close to a curve by an exponential sum approach. This yields a stronger bound than existing results obtained via geometric methods, but it is only appl…
For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert αn + β\rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In addition, we also establish an asymptotic formula with an additional square-free condition on $n$. Moreover, if $α$ is quadratic irrational then the asymptotic formulas holds for all sufficiently large $x$. Our ingredients come from the Harman sieve which we adapt suitably to sieve for $[y,z]$-smooth numbers. The arithmetic information comes from estimates for exponential s…
We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{θ/2}$, for some fixed $θ< 1$. When $s = 5$ we use a sieve method to show that all sufficiently large integers $n \equiv 5 \pmod {24}$ can be represented in the above form for $θ> 8/9$. This improves on earlier work by Liu, Lü and Zhan, who established a similar result for $θ> 9/10$. We also obtain estimates for the number of integers $n$ satisfying the necessary local conditions but lacking representations of the above form with $s = 3, 4$. When $…
For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with $N$ consecutive Fermat quotients that is nontrivial for $N\ge p^{1/2+ε}$ for any fixed $ε>0$. We use a recent idea of M. Z. Garaev together with a form of the large sieve inequality due to S. Baier and L. Zhao, to show that on average over $p$ one can obtain a nontrivial estimate for much shorter sums starting with $N\ge p^ε$. We also obtain lower bounds on …
We show that deciding the equality of two Dedekind sums $S(c,b)$, $S(d,b)$ is equivalent to deciding whether a Dedekind sum defined by $b, c, d$ takes a certain value. By means of this result we construct infinite sequences of pairwise equal Dedekind sums. Moreover, we prove a result that says how many Dedekind sums $S(d,b)$, $1\le d\le b-1$, may be equal to a given $S(c,b)$ if $b$ is a square-free number.
Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like polynomials is also investigated.
Dedekind sums $s(m,n)$ occur in many fields of mathematics. Since $s(m_1,n)=s(m_2,n)$ if $m_1\equiv m_2$ mod $n$, it is natural to ask which of the Dedekind sums $s(m,n)$, $0\le m<n$, take equal values. So far no simple criterion is known by which the equality of $s(m_1,n)$ and $s(m_2,n)$ could be decided. In this note we show how to obtain non-obvious examples of equal Dedekind sums. We consider two cases which mark the extreme possibilities for the argument $n$, namely, $n$ a prime power and $n$ square-free. Whereas we can give a partial overview of equal Dedekind sums in the prime power cas…
In a previous it was shown that the Dedkind sums $12s(m,n)$ and $12s(x,n)$, $1\le m,x\le n$, $(m,n)=(x,n)=1$, are equal mod $\Z$ if, and only if, $(x-m)(xm-1)\equiv 0$ mod $n$. Here we determine the cardinality of numbers $x$ in the above range that satisfy this congruence for a given number $m$.
Given an absolutely irreducible ternary form $F$, the purpose of this paper is to produce better upper bounds for the number of integer solutions to the equation F=0, that are restricted to lie in very lopsided boxes. As an application of the main result, a new paucity estimate is obtained for equal sums of two like powers.
Sign changes of Kloosterman sums with moduli having at most six prime factors
本文通过引入新的截断除数函数，改进了克洛斯特曼和符号变化的研究结果，结合了多种数学工具。
Partial sums of the hyperharmonic series
本文推广了Erdös和Niven关于调和级数部分和唯一性的结果，证明超调和级数的任意两个部分和也不相等。
In [3] it was shown that the Dedekond sums $s(m_1,n)$ and $s(m_2,n)$ are equal only if $(m_1m_2-1)(m_1-m_2)\equiv 0$ mod $n$. Here we show that the latter condition is equivalent to $12s(m_1,n)-12s(m_2,n)\in \Z$. In addition, we determine, for a given number $m_1$, the number of integers $m_2$ in the range $0\le m_2<n$, $(m_1,m_2)=1$, such that $12s(m_1,n)-12s(m_2,n)\in \Z$, provided that $n$ is square-free.
The least prime with a given primitive root and a variant of the larger sieve
本文在广义黎曼猜想下，将给定原根的最小素数上界改进为对数三次方量级，并证明大筛法新变体，优于现有结果。
A natural question about Dedekind sums is to find conditions on the integers $a_1, a_2$, and $b$ such that $s(a_1,b) = s(a_2, b)$. We prove that if the former equality holds then $ b \ | \ (a_1a_2-1)(a_1-a_2)$. Surprisingly, to the best of our knowledge such statements have not appeared in the literature. A similar theorem is proved for the more general Dedekind-Rademacher sums as well, namely that for any fixed non-negative integer $n$, a positive integer modulus $b$, and two integers $a_1$ and $a_2$ that are relatively prime to $b$, the hypothesis $r_n (a_1,b)= r_n (a_2,b)$ implies that $b \…
Short Quartic Exponential Sums in an Intermediate Range and Waring's Problem for Fourth Powers with Almost Equal Summands
研究十七个几乎相等的四次幂的华林问题，利用哈代 - 利特伍德圆法及短四次指数和精细估计，证明更短区间渐近公式，改进了该问题中\(H\)的先前已知下界。
We show that as soon as $h\to \infty$ with $X \to \infty$, almost all intervals $(x-h\log X, x]$ with $x \in (X/2, X]$ contain a product of at most two primes. In the proof we use Richert's weighted sieve, with the arithmetic information eventually coming from results of Deshouillers and Iwaniec on averages of Kloosterman sums.
We show how sums of some $5th$ powers can be written as sums of some cubics
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $θ> 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$, where $p_1, \dots, p_s$ are primes with $|p_j - (n/s)^{1/k}| \le n^{θ/k}$. This improves on earlier work by Wei and Wooley and by Huang who proved similar theorems when $θ> 19/24$.
Missing digits and sums of two prime squares
本文研究了在特定基数下省略固定数字且可表示为两个素数平方之和的整数，利用圆方法和筛法分析了其计数行为并给出了非平凡下界。
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or $10 (mod\,12)$ and has integer solutions if $M\equiv0,9,24$ or $33 (mod\,72)$; or $M\equiv1,2$ or $16 (mod\,24)$; or $M\equiv11 (mod\,12)$. All the allowed values of $M$ are characterized using necessary conditions. If $M$ is a square itself, then $M\equiv1 (mod\,24)$ and $(M-1)/24$ are all pentagonal numbers, except the first two.
Given a positive integer $n$ the $k$-fold divisor function $d_k(n)$ equals the number of ordered $k$-tuples of positive integers whose product equals $n$. In this article we study the variance of sums of $d_k(n)$ in short intervals and establish asymptotic formulas for the variance of sums of $d_k(n)$ in short intervals of certain lengths for $k=3$ and for $k \ge 4$ under the assumption of the Lindelöf hypothesis.
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the difference and sum of the triangular numbers of $\left(a+M-1\right)$ and $\left(a-1\right)$ in the product of their greatest common divisor $g$ and remaining square factors $δ^{2}$ and $σ^{2}$, yielding $c=gδσ$. Further, the condition that $g$ must be integer for several particular and general cases yield generalized Pell equations whose solutions allow to find all …
This paper is concerned with the diophantine system, $\sum_{i=1}^{s_1} x_i^r=\sum_{i=1}^{s_2} y_i^r,\, r=1,\,2,\,\ldots,\,k, $ where $s_1$ and $s_2$ are integers such that the total number of terms on both sides, that is, $s_1+s_2,$ is as small as possible. We define $β(k)$ to be the minimum value of $s_1+s_2$ for which there exists a nontrivial solution of this diophantine system. We find nontrivial integer solutions of this diophantine system when $k < 6$, and thereby show that $β(2) =4,\;\, β(3) = 6,\;\, 7 \leq β(4) \leq 8$ and $8 \leq β(5) \leq 10$.
We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.
Sums of $M$ consecutive squared integers $\left(a+i\right)^{2}$ equaling squared integers (for $a\geq1$, $0\leq i\leq M-1$) yield certain linear groupings of pairs $\left(a_{1},a_{2}\right)$ of $a$ values for successive same values of $M$ when these are linked by $a_{1}+a_{2}=μM+1$ with $μ=\left(η/δ\right)\in\mathbb{\mathbb{Q}}^{+}$. In this paper, congruent conditions on $M,η,δ$, and on the difference $\left(a_{2}-a_{1}\right)$ are demonstrated for these linear groupings to hold. It is found that $η\equiv1\left(mod\,2\right)$ and $δ\equiv0,1$ or $5\left(mod\,6\right)$, and if $δ\equiv0\left(m…
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} &N=p_{1}^{k}+p_{2}^{k}+\cdots+p_{s}^{k}, \\ &\left|p_{i}-( N/s)^{1/k}\right|\leq (N/s)^{θ/k},\ (1\leq i\leq s) \end{split} \end{align*} with \begin{align*} s\geq \frac{k(k+1)}{2}+1\ \ \textup{and}\ \ θ\geq {\bf 2/3}+\varepsilon. \end{align*} This enlarges the effective range of $s$ for which can be obtained by the method of Mätomaki and Xuancheng Shao \cite{MS}. [Discorrelati…
Using a recent result of Salberger, we establish the paucity of non-trivial positive integer solutions to a certain system of diagonal Diophantine equations.
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special cases coincide with zeta values at positive integer arguments.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。