Search arXivSearch

arXiv · 1410.8189

The frequency and the structure of large character sums

Abstract

Let $M(χ)$ denote the maximum of $|\sum_{n\le N}χ(n)|$ for a given non-principal Dirichlet character $χ\pmod q$, and let $N_χ$ denote a point at which the maximum is attained. In this article we study the distribution of $M(χ)/\sqrt{q}$ as one varies over characters $\pmod q$, where $q$ is prime, and investigate the location of $N_χ$. We show that the distribution of $M(χ)/\sqrt{q}$ converges weakly to a universal distribution $Φ$, uniformly throughout most of the possible range, and get (doubly exponential decay) estimates for $Φ$'s tail. Almost all $χ$ for which $M(χ)$ is large are odd characters that are $1$-pretentious. Now, $M(χ)\ge |\sum_{n\le q/2}χ(n)| = \frac{|2-χ(2)|}π\sqrt{q} |L(1,χ)|$, and one knows how often the latter expression is large, which has been how earlier lower bounds on $Φ$ were mostly proved. We show, though, that for most $χ$ with $M(χ)$ large, $N_χ$ is bounded away from $q/2$, and the value of $M(χ)$ is little bit larger than $\frac{\sqrt{q}}π |L(1,χ)|$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Bober, Leo Goldmakher, Andrew Granville, Dimitris Koukoulopoulos. 2017-06-20. The frequency and the structure of large character sums. https://doi.org/10.4171/jems%2F799

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On properties of the generalized Davenport Expansion

We study the continuity properties of a generalized Davenport Fourier expansion we recently discovered, by imposing conditions on the coefficients. We also put our expansion into perspective from the position of Appell sequences.

math.NT

On two Romanoff type problems of Erdős

Let $\mathcal{P}$ be the set of primes and, for $a>1$, put $\mathcal{S}_a={p+\lfloor a^k\rfloor:p\in\mathcal{P},\ k\ge1}$. Erdős recorded a question of Kalm'ar asking whether $\mathcal{S}_a$ has positive lower asymptotic density for every real $a>1$. We prove this for almost every $a>1$, with $$ \liminf_{N\to\infty}\frac{|\mathcal{S}_a\cap[1,N]|}{N} \ge \frac{1}{\log a+9C_0/π^2}, $$ where $C_0$ is an absolute constant. The dependence on $a$ has the correct order $1/\log a$ as $a\to\infty$. For almost every $a>1$ and every $η>0$, we also prove that at least $x^{1-η}$ positive integers $n\le x$ lie outside $\mathcal{S}_a$ for all sufficiently large $x$. For the golden ratio $φ=(1+\sqrt5)/2$, the corresponding sumset has positive lower asymptotic density and upper asymptotic density at most $1937/1938$. We also consider a problem of Erdős asking whether every sufficiently large odd integer is the sum of a squarefree integer and a power of two. Replacing $2^m$ by $\lfloor a^m\rfloor$, we prove for almost every $a>1$ that the exceptional set up to $x$ is $$ O_{a,\varepsilon}\!\left(\frac{x(\log\log x)^{1+\varepsilon}}{\sqrt{\log x}}\right), $$ and, allowing two distinct exponents, it is $$ O_{a,\varepsilon}\!\left(\frac{x(\log\log x)^{1+\varepsilon}}{\log x}\right). $$ The proofs use metric residue distribution and weighted pair correlation estimates for $\lfloor a^k\rfloor$, together with a congruence covering argument for the prime exceptional set.

math.NT

Short Interval Variance and Averaged Correlations of Arithmetic Functions

In this paper, we study the average shifted sum for general arithmetic functions by applying the standard Hardy--Littlewood circle method and using short-interval variance results. As applications, we prove some nontrivial upper bounds for shifted sums involving $μ_{k}(n).$ Assuming the Riemann Hypothesis and the Pair Correlation Conjecture of Montgomery, we also prove similar results involving the von Mangoldt function.

math.NT