Additive double character sums over some structured sets and applications
From MaRDI portal
Publication:5156872
Abstract: We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set , then this set contains a large subset for which the standard bound on the absolute value of the character sum over and any subset (which satisfies some restrictions on its size ) can be improved. Examples of such suitable self-maps are inversion and squaring. Then we apply this new bound to trace products and sum-product equations and improve results of the first author and of Gyarmati and S'ark"ozy.
Recommendations
Cites work
- scientific article; zbMATH DE number 1594313 (Why is no real title available?)
- Analogues of the Balog-Wooley decomposition for subsets of finite fields and character sums with convolutions
- ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
- Equations in finite fields with restricted solution sets. I: Character sums
- Equations in finite fields with restricted solution sets. II: Algebraic equations
- On sums and products of residues modulo p
- Trace of products in finite fields
Cited in
(3)
This page was built for publication: Additive double character sums over some structured sets and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156872)