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.











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)