Let $χ$ be a primitive character modulo $q$, and let $δ> 0$. Assuming that $χ$ has large order $d$, for any $d$th root of unity $α$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $χ(n) = α$, provided $x > q^δ$. This improves upon a previous result of the first author by removing restrictions on $q$ and $d$. As a corollary, we deduce that if the largest prime factor of $d$ satisfies $P^+(d) \to \infty$ then the level set $χ(n) = α$ has $o(x)$ such solutions whenever $x > q^δ$, for any fixed $δ> 0$.
Our proof relies, among other things, on a refinement of a mean-squared estimate for short sums of the characters $χ^\ell$, averaged over $1 \leq \ell \leq d-1$, due to the first author, which goes beyond Burgess' theorem as soon as $d$ is sufficiently large. We in fact show the alternative result that either (a) the partial sum of $χ$ itself, or (b) the partial sum of $χ^\ell$, for ``almost all'' $1 \leq \ell \leq d-1$, exhibits cancellation on the interval $[1,q^δ]$, for any fixed $δ> 0$.
By an analogous method, we also show that the Pólya-Vinogradov inequality may be improved for either $χ$ itself or for almost all $χ^\ell$, with $1 \leq \ell \leq d-1$. In particular, our averaged estimates are non-trivial whenever $χ$ has sufficiently large even order $d$.
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.
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.
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$).
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.
Large values of quadratic character sums revisited
Tongji University（同济大学）；Hainan Bielefeld University of Applied Sciences（海南比勒费尔德应用科学大学）；Morningside Center of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院晨兴数学中心）；Hunan University（湖南大学）
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.
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 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.
Soochow University（苏州大学）；Hainan Bielefeld University of Applied Sciences（海南比勒费尔德应用科技大学）；Morningside Center of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院晨兴数学中心）；Hunan University（湖南大学）；Tongji University（同济大学）
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.
In their recent work, the authors (2016) have combined classical ideas of A. G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli. In the present paper, these results are used to bound sums of the Mobius function twisted by characters of the same type, complementing and improving some earlier work of B. Green (2012). To achieve this, we obtain a series of results about the size and zero-free region of $L$-functions with the same class of moduli.
In this paper, we consider the distribution of the continuous paths of Dirichlet character sums modulo prime $q$ on the complex plane. We also find a limiting distribution as $q \rightarrow \infty$ using Steinhaus random multiplicative functions, stating properties of this random process. This is motivated by Kowalski and Sawin's work on Kloosterman paths.
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 .
Let $\mathcal L^+$ be the set of all primes $p$ for which the sums of $\left(\frac{n}{p}\right)$ over the interval $[1,N]$ are non-negative for all $N$. We prove that the estimate \[ |\mathcal L^+\cap [1,x]|\ll \frac{x}{\ln x(\ln\ln x)^{c-o(1)}} \] holds for $c\approx 0.0368$
This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at any real-valued polynomial. The resulting upper bound for the mixed character sum is nontrivial when the length of the sum is at least $q^β$ with $β> 1/2 - 1/(2(n+1))$ in each coordinate. This work capitalizes on the recent stratification of multiplicative character sums due to Xu, and the resolution of the Vinogradov Mean Value Theorem in arbitrary dimension…
The aim of this paper is to deal with congruences for Jacobi sums of order $2l^{2}$ over a finite field $\mathbb{F}_{q}, q=p^{r}$, $p^{r}\equiv 1\ (mod \ 2l^{2})$, where $l>3$ and $p$ are primes. Further, we also calculate Jacobi sums $J_{2l^{2}}(1,n)$ of order $2l^{2}$ in terms of Dickson-Hurwitz sums.
