Double Character Sums with Intervals and Arbitrary Sets
- 作者: Shkredov I.D.1,2,3, Shparlinski I.E.4
-
隶属关系:
- Steklov Mathematical Institute of Russian Academy of Sciences
- Institute for Information Transmission Problems (Kharkevich Institute)
- Moscow Institute of Physics and Technology (State University)
- Department of Pure Mathematics
- 期: 卷 303, 编号 1 (2018)
- 页面: 239-258
- 栏目: Article
- URL: https://journals.rcsi.science/0081-5438/article/view/175686
- DOI: https://doi.org/10.1134/S0081543818080199
- ID: 175686
如何引用文章
详细
We obtain a new bound on certain double sums of multiplicative characters which improves several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study in additive combinatorics.
作者简介
Ilya Shkredov
Steklov Mathematical Institute of Russian Academy of Sciences; Institute for Information Transmission Problems (Kharkevich Institute); Moscow Institute of Physics and Technology (State University)
编辑信件的主要联系方式.
Email: ilya.shkredov@gmail.com
俄罗斯联邦, ul. Gubkina 8, Moscow, 119991; Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141701
Igor Shparlinski
Department of Pure Mathematics
编辑信件的主要联系方式.
Email: igor.shparlinski@unsw.edu.au
澳大利亚, Sydney, NSW, 2052
补充文件
