Large sums of high‐order characters
From MaRDI portal
Publication:6199321
DOI10.1112/jlms.12841arXiv2207.14377OpenAlexW4390026473MaRDI QIDQ6199321
Publication date: 23 February 2024
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.14377
Applications of sieve methods (11N36) Estimates on character sums (11L40) Distribution of integers with specified multiplicative constraints (11N25) Other results on the distribution of values or the characterization of arithmetic functions (11N64) Inverse problems of additive number theory, including sumsets (11P70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pólya-Vinogradov and the least quadratic nonresidue
- Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
- Large character sums: Burgess's theorem and zeros of \(L\)-functions
- A new critical pair theorem applied to sum-free sets in Abelian groups
- A multiplicative analogue of Schnirelmann's theorem
- Large even order character sums
- On Character Sums and Primitive Roots†
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
- Quantitative mean value theorems for nonnegative multiplicative functions II
- On the concentration of additive functions
- Integers Free From Large and Small Primes
- A character-sum estimate and applications
- Decay of Mean Values of Multiplicative Functions
- Improving the Burgess bound via Pólya-Vinogradov
- Upper Bounds for L(1, )
- Large odd order character sums and improvements of the Pólya-Vinogradov inequality
- Short Character Sums and the Pólya–Vinogradov Inequality
- Numbers with small prime factors, and the least 𝑘th power non-residue
- Exponential sums with multiplicative coefficients
- Three conjectures about character sums
This page was built for publication: Large sums of high‐order characters
