Several generalizations of Weil sums
From MaRDI portal
The author considers several generalizations and variations of Burgess' and Weil's character sum inequalities and formulates some conjectures. Instead of summing over intervals, he works with \(k\)-tuple sums ranging over certain subsets and with incomplete character sums taken over cosets. Moreover, the author discusses the connections with graph theory and points out applications to extremal graphs, communication complexity and circuit complexity.
Recommendations
Cited in
(12)- Gauss sums and the maximum cliques in generalized Paley graphs of square order
- On the restricted isometry property of the Paley matrix
- Quantitative aspects of acyclicity
- Generating sets for the multiplicative groups of algebras over finite fields and expander graphs
- Bilinear character sums over elliptic curves
- Double exponential sums over thin sets
- Derandomizing restricted isometries via the Legendre symbol
- Note on a result of Chung on Weil type sums
- 7. Weil sums of binomials: properties, applications and open problems
- Infinite Paley graphs
- Generalized Diophantine 𝑚-tuples
- Coding and Cryptography
This page was built for publication: Several generalizations of Weil sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336061)