ID: math/0304217

A sum-product estimate in fields of prime order

April 16, 2003

View on ArXiv

Similar papers 5

On the few products, many sums problem

December 1, 2017

86% Match
Brendan Murphy, Misha Rudnev, ... , Shteinikov Yurii N.
Combinatorics

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are based on new combinatorial lemmata, which may be of independent interest. Our main results are the inequality $$ |A-A|^3|AA|^5 \gtrsim |A|^{10}, $$ over the reals, "redistributing" the exponents in the textbook Elekes sum-product inequality a...

Find SimilarView on arXiv

Products of Differences over Arbitrary Finite Fields

May 18, 2017

86% Match
Brendan Murphy, Giorgis Petridis
Combinatorics
Number Theory

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| > \frac{q}{2}. \] Any $\delta < 1/13,542$ suffices for sufficiently large $q$. This improves the condition $|A| > q^{2/3}$, due to Bennett, Hart, Iosevich, Pakianathan, and Rudnev, that is typical for such questions. Our proof is based on ...

Find SimilarView on arXiv

Szemeredi-Trotter type theorem and sum-product estimate in finite fields

November 28, 2007

86% Match
Le Anh Vinh
Combinatorics

We study a Szemer\'edi-Trotter type theorem in finite fields. We then use this theorem to obtain an improved sum-product estimate in finite fields.

Find SimilarView on arXiv

Sum-free sets which are closed under multiplicative inverses

September 9, 2020

86% Match
Katherine Benjamin
Number Theory

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| < (0.25 - c)|\mathbb{F}| + o(|\mathbb{F}|)$ as $|\mathbb{F}| \rightarrow \infty$. We contrast this with the result that such sets exist with size at least $0.25|\mathbb{F}| - o(|\mathbb{F}|)$ when $\mathbb{F}$ has characteristic $2$.

Find SimilarView on arXiv

Fourier analysis and expanding phenomena in finite fields

September 30, 2009

86% Match
Derrick Hart, Liangpan Li, Chun-Yen Shen
Number Theory
Combinatorics

In this paper the authors study set expansion in finite fields. Fourier analytic proofs are given for several results recently obtained by Solymosi, Vinh and Vu using spectral graph theory. In addition, several generalizations of these results are given. In the case that $A$ is a subset of a prime field $\mathbb F_p$ of size less than $p^{1/2}$ it is shown that $|\{a^2+b:a,b \in A\}|\geq C |A|^{147/146}$, where $|\cdot|$ denotes the cardinality of the set and $C$ is an abso...

Find SimilarView on arXiv

On asymptotic formulae in some sum-product questions

February 25, 2018

86% Match
Ilya D. Shkredov
Number Theory
Combinatorics

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2 (\mathbf{F}_p)$ due to Helfgott. Here some of our applications: $\bullet~$ a new bound for the number of the solutions to the equation $(a_1-a_2) (a_3-a_4) = (a'_1-a'_2) (a'_3-a'_4)$, $\,a_i, a'_i\in A$, $A$ is an arbitrary subset of $\mathbf{F}_...

Find SimilarView on arXiv

On the additive bases problem in finite fields

July 2, 2016

86% Match
Hamed Hatami, Quehen Victoria de
Combinatorics

We prove that if $G$ is an Abelian group and $A_1,\ldots,A_k \subseteq G$ satisfy $m A_i=G$ (the $m$-fold sumset), then $A_1+\ldots+A_k=G$ provided that $k \ge c_m \log n$. This generalizes a result of Alon, Linial, and Meshulam [Additive bases of vector spaces over prime fields. J. Combin. Theory Ser. A, 57(2):203--210, 1991] regarding the so called additive bases.

Find SimilarView on arXiv

On Products of Shifts in Arbitrary Fields

December 5, 2018

86% Match
Audie Warren
Combinatorics
Number Theory

We adapt the approach of Rudnev, Shakan, and Shkredov to prove that in an arbitrary field $\mathbb{F}$, for all $A \subset \mathbb{F}$ finite with $|A| < p^{1/4}$ if $p:= Char(\mathbb{F})$ is positive, we have $$|A(A+1)| \gtrsim |A|^{11/9}, \qquad |AA| + |(A+1)(A+1)| \gtrsim |A|^{11/9}.$$ This improves upon the exponent of $6/5$ given by an incidence theorem of Stevens and de Zeeuw.

Find SimilarView on arXiv

Growth Estimates in Positive Characteristic via Collisions

December 21, 2015

85% Match
Esen Aksoy Yazici, Brendan Murphy, ... , Shkredov Ilya
Combinatorics

Let $F$ be a field of characteristic $p>2$ and $A\subset F$ have sufficiently small cardinality in terms of $p$. We improve the state of the art of a variety of sum-product type inequalities. In particular, we prove that $$ |AA|^2|A+A|^3 \gg |A|^6,\qquad |A(A+A)|\gg |A|^{3/2}. $$ We also prove several two-variable extractor estimates: ${\displaystyle |A(A+1)| \gg|A|^{9/8},}$ $$ |A+A^2|\gg |A|^{11/10},\; |A+A^3|\gg |A|^{29/28}, \; |A+1/A|\gg |A|^{31/30}.$$ Besides, we addres...

Find SimilarView on arXiv

New sum-product type estimates over finite fields

August 3, 2014

85% Match
Oliver Roche-Newton, Misha Rudnev, Ilya D. Shkredov
Combinatorics

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective three-space $PG(3,F)$, with $m\geq n=O(p^2)$, is $$O( m\sqrt{n} + km ),$$ where $k$ denotes the maximum number of collinear planes. The main result is a significant improvement of the state-of-the-art sum-product inequality over fields with p...

Find SimilarView on arXiv