ID: math/0702780

An explicit sum-product estimate in $\mathbb{F}_p$

February 26, 2007

View on ArXiv
M. Z. Garaev
Mathematics
Number Theory

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a non-empty subset of $\mathbb{F}_p.$ In this paper we give an explicit version of the sum-product estimate of Bourgain, Katz, Tao and Bourgain, Glibichuk, Konyagin on the size of $\max\{|A+A|, |AA|\}.$ In particular, our result implies that if $1<|A|\le p^{7/13}(\log p)^{-4/13},$ then $$ \max\{|A+A|, |AA|\}\gg \frac{|A|^{15/14}}{(\log|A|)^{2/7}} . $$

Similar papers 1

Slightly improved sum-product estimates in fields of prime order

July 12, 2009

96% Match
Liangpan Li
Number Theory
Combinatorics

Let $\mathbb{F}_p$ be the field of residue classes modulo a prime number $p$ and let $A$ be a nonempty subset of $\mathbb{F}_p$. In this paper we show that if $|A|\preceq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succeq|A|^{13/12};\] if $|A|\succeq p^{0.5}$, then \[ \max\{|A\pm A|,|AA|\}\succapprox \min\{|A|^{13/12}(\frac{|A|}{p^{0.5}})^{1/12},|A|(\frac{p}{|A|})^{1/11}\}.\] These results slightly improve the estimates of Bourgain-Garaev and Shen. Sum-product estimates on differ...

Find SimilarView on arXiv

The sum-product estimate for large subsets of prime fields

June 5, 2007

95% Match
M. Z. Garaev
Number Theory
Combinatorics

Let $\mathbb{F}_p$ be the field of a prime order $p.$ It is known that for any integer $N\in [1,p]$ one can construct a subset $A\subset\mathbb{F}_p$ with $|A|= N$ such that $$ \max\{|A+A|, |AA|\}\ll p^{1/2}|A|^{1/2}. $$ In the present paper we prove that if $A\subset \mathbb{F}_p$ with $|A|>p^{2/3},$ then $$ \max\{|A+A|, |AA|\}\gg p^{1/2}|A|^{1/2}. $$

Find SimilarView on arXiv

An improved bound on the sum-product estimate in $\mathbb{F}_{p}$

December 9, 2020

95% Match
Connor Paul Wilson
Combinatorics
Number Theory

We give an improved bound on the famed sum-product estimate in a field of residue class modulo $p$ ($\mathbb{F}_{p}$) by Erd\H{o}s and Szemeredi, and a non-empty set $A \subset \mathbb{F}_{p}$ such that: $$ \max \{|A+A|,|A A|\} \gg \min \left\{\frac{|A|^{15 / 14} \max \left\{1,|A|^{1 / 7} p^{-1 / 14}\right\}}{(\log |A|)^{2 / 7}}, \frac{|A|^{11 / 12} p^{1 / 12}}{(\log |A|)^{1 / 3}}\right\}, $$ and more importantly: $$\max \{|A+A|,|A A|\} \gg \frac{|A|^{15 / 14}}{(\log |A|)^{2 ...

Find SimilarView on arXiv

A sum-product estimate in fields of prime order

April 16, 2003

94% Match
S. V. Konyagin
Number Theory

Let q be a prime, A be a subset of a finite field $F=\Bbb Z/q\Bbb Z$, $|A|<\sqrt{|F|}$. We prove the estimate $\max(|A+A|,|A\cdot A|)\ge c|A|^{1+\epsilon}$ for some $\epsilon>0$ and c>0. This extends the result of J. Bourgain, N. Katz, and T. Tao.

Find SimilarView on arXiv

A new sum-product estimate in prime fields

July 29, 2018

93% Match
Changhao Chen, Bryce Kerr, Ali Mohammadi
Combinatorics
Number Theory

In this paper we obtain a new sum-product estimate in prime fields. In particular, we show that if $A\subseteq \mathbb{F}_p$ satisfies $|A|\le p^{64/117}$ then $$ \max\{|A\pm A|, |AA|\} \gtrsim |A|^{39/32}. $$ Our argument builds on and improves some recent results of Shakan and Shkredov which use the eigenvalue method to reduce to estimating a fourth moment energy and the additive energy $E^+(P)$ of some subset $P\subseteq A+A$. Our main novelty comes from reducing the estim...

Find SimilarView on arXiv

Sum-Product Type Estimates over Finite Fields

March 19, 2019

92% Match
Esen Aksoy Yazici
Combinatorics
Classical Analysis and ODEs
Number Theory

Let $\mathbb{F}_q$ denote the finite field with $q$ elements where $q=p^l$ is a prime power. Using Fourier analytic tools with a third moment method, we obtain sum-product type estimates for subsets of $\mathbb{F}_q$. In particular, we prove that if $A\subset \mathbb{F}_q$, then $$|AA+A|,|A(A+A)|\gg\min\left\{q, \frac{|A|^2}{q^{\frac{1}{2}}} \right\},$$ so that if $A\ge q^{\frac{3}{4}}$, then $|AA+A|,|A(A+A)|\gg q$.

Find SimilarView on arXiv

An improved sum-product estimate over finite fields

May 31, 2011

92% Match
Liangpan Li, Oliver Roche-Newton
Combinatorics

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new estimate matches, up to a logarithmic factor, the current best known bound obtained over prime fields by Rudnev (\cite{mishaSP}).

Find SimilarView on arXiv

Attaining the exponent $5/4$ for the sum-product problem in finite fields

March 15, 2021

91% Match
Ali Mohammadi, Sophie Stevens
Combinatorics
Number Theory

We improve the exponent in the finite field sum-product problem from $11/9$ to $5/4$, improving the results of Rudnev, Shakan and Shkredov. That is, we show that if $A\subset \mathbb{F}_p$ has cardinality $|A|\ll p^{1/2}$ then \[ \max\{|A\pm A|,|AA|\} \gtrsim |A|^\frac54 \] and \[ \max\{|A\pm A|,|A/A|\}\gtrsim |A|^\frac54\,. \]

Find SimilarView on arXiv

Sum-product estimates in finite fields

September 15, 2006

91% Match
D. Hart, A. Iosevich, J. Solymosi
Combinatorics
Classical Analysis and ODEs

We prove, using combinatorics and Kloosterman sum technology that if $A \subset {\Bbb F}_q$, a finite field with $q$ elements, and $q^{{1/2}} \lesssim |A| \lesssim q^{{7/10}}$, then $\max \{|A+A|, |A \cdot A|\} \gtrsim \frac{{|A|}^{{3/2}}}{q^{{1/4}}$.

Find SimilarView on arXiv

Sum-product estimates over arbitrary finite fields

May 23, 2018

90% Match
Doowon Koh, Sujin Lee, ... , Shen Chun-Yen
Number Theory

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be viewed as the Erd\H{o}s distinct distances problem for Cartesian product sets over arbitrary finite fields. We also prove that \[\max\{|A+A|, |A^2+A^2|\}\gg |A|^{1+\frac{1}{42}}, ~|A+A^2|\gg |A|^{1+\frac{1}{84}}.\]

Find SimilarView on arXiv