A sum-product estimate in fields of prime order
S.V.Konyagin

TL;DR
This paper proves a sum-product estimate in finite fields of prime order, showing that either the sum set or the product set of a subset must be significantly larger than the original set, extending previous results.
Contribution
It establishes a new lower bound for the maximum of sum and product set sizes in prime fields, advancing the understanding of sum-product phenomena.
Findings
Either |A+A| or |A·A| is at least c|A|^{1+ε} for some ε>0 and c>0
Extends Bourgain, Katz, Tao's sum-product estimate to broader settings
Provides quantitative bounds for sum-product growth in finite fields
Abstract
Let q be a prime, A be a subset of a finite field , . We prove the estimate for some and c>0. This extends the result of J. Bourgain, N. Katz, and T. Tao.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research
