Tomasz Schoen, Ilya D. Shkredov
We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Balog and Wooley have recently proved that any subset $A$ of either real numbers or of a prime finite field can be decomposed into two parts $U$ and $V$, one of small additive energy and the other of small multiplicative energy. In the case of arbitrary finite fields, we obtain an analogue that under some natural restrictions for a rational function $f$ both the additive energies of $U$ and $f(V)$ are small. Our method is based on bounds of character sums which leads to the restriction $\# A > q^{1/2}$ where $q$ is the field size. The bound is optimal, up to logarithmic factors, when $\# A \ge…
$L^1$ means of exponential sums with multiplicative coefficients. I
本研究改进了带Liouville函数和Möbius函数系数的指数和$L^1$范数的下界，通过利用系数与Dirichlet $L$-函数零点的联系统一两种情形的证明，并将在后续论文中推广至一般乘性函数。
In the paper we study two characteristics D^+ (A), D^\times (A) of a set A which play important role in recent results concerning sum-product phenomenon. Also we obtain several variants and improvements of the Balog-Wooley decomposition theorem. In particular, we prove that any finite subset of real numbers can be split into two sets with small quantities D^+ and D^\times.
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.
On the Moments of Exponential Sums over r-Free Polynomials
本文基于整数情形的相关技术，确定了有限域多项式环上 r-free 多项式指数和的 $k$ 阶矩的精确阶，并在超临界情形下利用 Hardy-Littlewood 圆法函数域类比获得了渐近公式。
In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2 (\mathbf{F}_p)$ due to Helfgott. Here some of our applications: $\bullet~$ a new bound for the number of the solutions to the equation $(a_1-a_2) (a_3-a_4) = (a'_1-a'_2) (a'_3-a'_4)$, $\,a_i, a'_i\in A$, $A$ is an arbitrary subset of $\mathbf{F}_p$, $\bullet~$ a new effective bound for multilinear exponential sums of Bourgain, $\bullet~$ an asymptotic analogue of th…
Improvements on exponential sums related to Piatetski-Shapiro primes
本文通过改进Type I和的方法，提高了与Piatetski-Shapiro素数相关的三次哥德巴赫问题的界，并研究了这些素数在算术级数和Beatty序列交集中的分布。
We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set $A$ of integers may be written as $A = B \cup C$, where $B$ and $C$ are disjoint sets satisfying \[ |\{ (b_1, \dots, b_{2s}) \in B^{2s} \ | \ b_1 + \dots + b_{s} = b_{s+1} + \dots + b_{2s}\}| \ll_{s} |B|^{2s - (\log \log s)^{1/2 - o(1)}} \] and \[ |\{ (c_1, \dots, c_{2s}) \in C^{2s} \ | \ c_1 \dots c_{s} = c_{s+1} \dots c_{2s} \}| \ll_{s} |C|^{2s - (\log \log s)^{1/2 - o(1)}}.\] This generalises previous results of Bourgain--Chang on many-fold sumsets and product sets to the setting o…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for zeros of such Kloosterman sums.
In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang. The proof uses Croot-Sisask almost periodicity lemma.
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study of additive combinatorics.
The Prime Geodesic Theorem for $\mathrm{PSL}_{2}(\mathbb{Z}[i])$ and Spectral Exponential Sums
本文研究 Picard 流形的素测地定理，通过精细分析 Kloosterman 和与振荡积分证明了误差项的平均界与逐点界，并给出了谱指数和的渐近公式及数值验证。
We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument is based on getting an upper bound for the l1 norm of the Fourier coefficients of a generalized arithmetic progression. Our method also applies to give upper bounds for polynomial exponential sums.
In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain circumstances we may improve on some results of Pierce for multidimensional mixed sums and we extend a bound for character sums with products of linear forms to the setting of mixed sums.
We improve a recent result by Shparlinski and Banks related to sums with convolution of Dirichlet characters.
Structure of large quadratic character sums
本文基于Lamzouri的工作，研究大二次特征和的分布，并获得了具有大特征和的二次特征的结构结果。
Let $q$ be a positive integer, $χ$ a nontrivial character mod $q$, $\mathcal{I}$ an interval of length not exceeding $q.$ In this paper we shall study the character sum analogue of the well-known Kloosterman sum,\[\sum_{\substack{a\in\mathcal{I} \gcd(a,q)=1}}χ(ma+n\overline{a}),\] where $\overline{a}$ is the multiplicative inverse of $a\bmod q$. The mean square values and bilinear forms for such sums are proved.
We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the Pólya-Vinogradov theorem for maximal character sums, the maximal admissible range in Burgess' estimate for short character sums, and upper bounds for $L(1,χ)$ and $L(1+it,χ)$) are more-or-less "equivalent". We also obtain a new mean value theorem for logarithmically weighted sums of 1-bounded multiplicative functions.
On quadratic character sums over quartics
本文研究了多项式变元的二次特征和问题，推导出了四次和三次多项式变元的二次特征和的变换公式。
We consider character sums determined by isogenies of elliptic curves over finite fields. We prove a congruence condition for character sums attached to arbitrary cyclic isogenies, and produce explicit formulas for isogenies of small degree.
Note on large quadratic character sums
本文在广义黎曼假设下，证明了二次狄利克雷特征和存在大值的Omega结果，深化了对该特征和极值行为的理解。
Large quadratic character sums
本文在广义黎曼假设下证明二次狄利克雷特征和的Omega结果，其精确度与之前大素数模所有特征的结果相当。
We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.
Recently, Granville and Soundararajan have made fundamental breakthroughs in the study of character sums. Building on their work and using estimates on short character sums developed by Graham-Ringrose and Iwaniec, we improve the Polya-Vinogradov inequality for characters with smooth conductor.
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.
This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.
We prove that Burgess's bound gives an estimate not just for a single character sum, but for a mean value of many such sums.
Character Sums and the Riemann Hypothesis
本文证明一个看似简单的不等式蕴含黎曼猜想，并提出通过Legendre符号和来研究该不等式的方法。
We consider a family of character sums as multiplicative analogues of Kloosterman sums. Using Gauss sums, Jacobi sums and Deligne's bound for hyper-Kloosterman sums, we establish asymptotic formulae for any real (positive) moments of the above character sum as the character runs over all non-trivial multiplicative characters mod $p.$ Moreover, an arcsine law is also established as a consequence of the method of moments. The evaluations of these moments also allow us to obtain asymptotic formulae for moments of such character sums weighted by special $L$-values (at $1/2$ and $1$).
We obtain explicit bounds on the moments of character sums, refining estimates of Montgomery and Vaughan. As an application we obtain results on the distribution of the maximal magnitude of character sums normalized by the square root of the modulus, finding almost double exponential decay in the tail of this distribution.
In this paper, we prove a lower bound for $\underset{χ\neq χ_0}{\max}\bigg|\sum_{n\leq x} χ(n)\bigg|$, when $x= \frac{q}{(\log q)^B}$. This improves on a result of Granville and Soundararajan for large character sums when the range of summation is wide. When $B$ goes to zero, our lower bound recovers the expected maximal value of character sums for most characters.
Character sums to prime power moduli evaluated at binary quadratic forms
研究素数幂模下二元二次型的特征和估计，采用p进分析方法，补充Heath-Brown对平方自由模的估计。
Large values of quadratic character sums revisited
本文在广义黎曼假设下，研究了二次特征和在求和长度超过模数平方根时的大值问题，并得出新的Omega结果。
A classical result of Paley shows that there are infinitely many quadratic characters $χ\mod{q}$ whose character sums get as large as $\sqrt{q}\log \log q$; this implies that a conditional upper bound of Montgomery and Vaughan cannot be improved. In this paper, we derive analogous lower bounds on character sums for characters of odd order, which are best possible in view of the corresponding conditional upper bounds recently obtained by the first author.
We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which previously known methods do not apply. In particular, in the multiplicative characters modulo a prime $p$ we break the barrier of $p^{1/4}$ for ranges of individual variables.
We study smoothed character sums involving $\sum_{m,n} ( \frac{m}{n} )_2$, where $( \frac{m}{n} )_2$ denotes the quadratic symbol in the Gaussian field. We extend previously known results to obtain asymptotic formulas for the sums considered to larger ranges of $m$ and $n$.
We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$. These bounds rely on some recent advances in additive combinatorics.
In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)^A$ can take large values.
Large quadratic character sums with multiplicative coefficients
本文在广义黎曼假设下，研究了具有乘法系数的二次狄利克雷特征和的条件大值，并证明了若干Omega结果。
A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order. Previously our bounds were only known under the assumption of the Generalized Riemann Hypothesis.
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 consider the size of large character sums, proving new lower bounds for the quantity $Δ(N,q) = \sup_{χ\neq χ_0 mod q} |\sum_{n < N} χ(n)|$ for almost all ranges of $N$. The results are proven using the resonance method and saddle point analysis.
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[αn + β] : n =1,2,... \}$, where $α,β\in\R$, and $α$ is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established.
Character sums over elements of extensions of finite fields with restricted coordinates
本文研究了有限域扩张元素上具限制坐标的字符和问题，获得了乘性和加性特征和的非平凡界，并特别给出了Cantor集有限域类比上的非平凡估计。
The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This leads to a power-saving if the modulus is smooth enough. As an application, a fast, and potentially practical, method to compute Dirichlet L-functions with complexity exponent 1/3 for smooth enough moduli is derived.
On partial T-adic exponential sums and partial exponential sums with p-power conductor
本文推广了Liu和Wan的T进指数和理论到部分情形，证明了相关L函数的T进亚纯性，从而给出p幂导子特征部分L函数有理性的p进证明，并给出Newton-over-Hodge估计。
Bounds for moments of quadratic Dirichlet character sums
本文研究平滑二次 Dirichlet 特征和的矩估计问题，在广义 Riemann 假设下证明其上界，从而确认 M. Jutila 的相关猜想。
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
We prove that the existence of exceptional real zeroes of Dirichlet $L$-functions would lead to cancellations in the sum $\sum_{p\leq x} \Kl(1, p)$ of Kloosterman sums over primes, and also to sign changes of $\Kl(1, n)$, where $n$ runs over integers with exactly two prime factors. Our arguments involve a variant of Bombieri's sieve, bounds for twisted sums of Kloosterman sums, and work of Fouvry and Michel on sums of $\left| \Kl(1, n)\right|$.
In this work we establish a Burgess bound for short multiplicative character sums in arbitrary dimensions, in which the character is evaluated at a homogeneous form that belongs to a very general class of "admissible" forms. This $n$-dimensional Burgess bound is nontrivial for sums over boxes of sidelength at least $q^β$, with $β> 1/2 - 1/(2(n+1))$. This is the first Burgess bound that applies in all dimensions to generic forms of arbitrary degree. Our approach capitalizes on a recent stratification result for complete multiplicative character sums evaluated at rational functions, due to the s…
In this paper we consider the problem of estimating character sums to composite modulus and obtain some progress towards removing the cubefree restriction in the Burgess bound. Our approach is to estimate high order moments of character sums in terms of solutions to congruences with Kloosterman fractions and we deal with this problem by extending some techniques of Bourgain, Garaev, Konyagin and Shparlinski and Bourgain and Garaev from the setting of prime modulus to composite modulus. As an application of our result we improve an estimate of Norton.
We show that for any mod $2^m$ characters, $χ_1, χ_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}χ_1(x) χ_2(Ax^k+B), $$ has a simple explicit evaluation.
We use the $q$-analogue of van der Corput's method to estimate short character sums to smooth moduli. If $χ$ is a primitive Dirichlet character modulo a squarefree, $q^δ$-smooth integer $q$ we show that $$L(\frac12,χ)\ll_εq^{\frac{27}{164}+O(δ)+ε}.$$
We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V α_u β_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$ elements, with integers $U$, $V$, a polynomial $f\in {\mathbb F}_p[X] $ and some complex weights $\{α_u\}$, $\{β_v\}$. In particular, for $f(X)=aX+b$ we obtain new bounds of bilinear sums with Kloosterman fractions. We also obtain new bounds for similar sums with multiplicative characters of ${\mathbb F}_p$.
We prove several old and new theorems about finite sums involving characters and trigonometric functions. These sums can be traced back to theta function identities from Ramanujan's notebooks and were systematically first studied by Berndt and Zaharescu; their proofs involved complex contour integration. We show how to prove most of Berndt-Zaharescu's and some new identities by elementary methods of discrete Fourier Analysis.
Large values of quadratic character sums
本文在广义黎曼假设（GRH）下，研究二次狄利克雷特征和的大值，证明了短、长二次特征和的新欧米伽结果，改进了已有结论。
We combine a classical idea of Postnikov (1956) with the method of Korobov (1974) for estimating double Weyl sums, deriving new bounds on short character sums when the modulus $q$ has a small core $\prod_{p\mid q}p$. Using this estimate, we improve certain bounds of Gallagher (1972) and Iwaniec (1974) for the corresponding $L$-functions. In turn, this allows us to improve the error term in the asymptotic formula for primes in short arithmetic progressions modulo a power of a fixed prime. As yet another application of our bounds, we substantially extend the region free of Siegel zeros.
Bounds for moments of quadratic Dirichlet character sums of prime moduli
本文在广义黎曼假设下，先对模8p的二次Dirichlet L-函数平移矩建立精确上界，再据此证明素数模二次Dirichlet特征和矩的界。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。