Large sums of high order characters. II.

DOI10.5802/JTNB.1347MaRDI QIDQ6871687zbMATH OpenFDO

Authors Alexander P. Mangerel, Yichen You

Publication date 20 January 2026

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://doi.org/10.5802/JTNB.1347

zbMATH Keywords

additive combinatoricsDirichlet character sumsinverse sumset theoremsmultiplicative functionspretentious number theory

Mathematics Subject Classification ID

Estimates on character sums (11L40) Distribution of integers with specified multiplicative constraints (11N25) Applications of sieve methods (11N36) 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

• A new critical pair theorem applied to sum-free sets in Abelian groups
• Decay of Mean Values of Multiplicative Functions
• Effective mean value estimates for complex multiplicative functions
• Halving an estimate obtained from Selberg's upper bound method
• Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• Large odd order character sums and improvements of the Pólya-Vinogradov inequality
• Large sums of high‐order characters
• Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
• On the concentration of additive functions
• ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
• Quantitative mean value theorems for nonnegative multiplicative functions II
• Three conjectures about character sums

This page was built for publication: Large sums of high order characters. II.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871687)