On character sums and exponential sums over generalized arithmetic progressions

From MaRDI portal
Publication:4928906

DOI10.1112/BLMS/BDS115zbMATH Open1308.11073arXiv1206.0521OpenAlexW1981458425MaRDI QIDQ4928906FDOQ4928906

Xuancheng Shao

Publication date: 19 June 2013

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1206.0521




Recommendations




Cited In (7)





This page was built for publication: On character sums and exponential sums over generalized arithmetic progressions

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