Double Character Sums with Intervals and Arbitrary Sets


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018