On character sums and exponential sums over generalized arithmetic progressions
From MaRDI portal
Publication:4928906
DOI10.1112/BLMS/BDS115zbMATH Open1308.11073arXiv1206.0521OpenAlexW1981458425MaRDI QIDQ4928906FDOQ4928906
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
- On some particular character and exponential sums
- scientific article; zbMATH DE number 1339097
- Character sums over generalized square-full integers and applications
- On a kind of character sums and their recurrence properties
- Character sums over generalized Lehmer numbers
- Character sums with exponential functions over smooth numbers
- On the character sum of polynomials and the two-term exponential sums
- On Character Sums and L-Series†
- scientific article; zbMATH DE number 6405308
- On the two-term exponential sums and character sums of polynomials
Cited In (7)
- Title not available (Why is that?)
- From Ingham to Nazarov's inequality: a survey on some trigonometric inequalities
- On the character sum of polynomials and the two-term exponential sums
- Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
- Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
- Multilinear exponential sums with a general class of weights
- Some multiplicative equations in finite fields
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)