ID: 1705.06581

Products of Differences over Arbitrary Finite Fields

May 18, 2017

View on ArXiv

Similar papers 2

Stronger sum-product inequalities for small sets

August 25, 2018

86% Match
Misha Rudnev, George Shakan, Ilya Shkredov
Combinatorics
Number Theory

Let $F$ be a field and a finite $A\subset F$ be sufficiently small in terms of the characteristic $p$ of $F$ if $p>0$. We strengthen the "threshold" sum-product inequality $$|AA|^3 |A\pm A|^2 \gg |A|^6\,,\;\;\;\;\mbox{hence} \;\; \;\;|AA|+|A+A|\gg |A|^{1+\frac{1}{5}},$$ due to Roche-Newton, Rudnev and Shkredov, to $$|AA|^5 |A\pm A|^4 \gg |A|^{11-o(1)}\,,\;\;\;\;\mbox{hence} \;\; \;\;|AA|+|A\pm A|\gg |A|^{1+\frac{2}{9}-o(1)},$$ as well as $$ |AA|^{36}|A-A|^{24} \gg |A|^{73...

Find SimilarView on arXiv

A sum-product estimate in fields of prime order

April 16, 2003

86% 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

On the Number of Dot Products Determined by a Large Set and One of its Translates in Finite Fields

October 27, 2015

86% Match
Giorgis Petridis
Combinatorics

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) = \mathbb{F}_q$.

Find SimilarView on arXiv

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

March 15, 2021

85% 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

A new sum-product estimate in prime fields

July 29, 2018

85% 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

Some remarks on the asymmetric sum--product phenomenon

May 26, 2017

85% Match
Ilya D. Shkredov
Number Theory
Combinatorics

Using some new observations connected to higher energies, we obtain quantitative lower bounds on $\max\{|AB|, |A+C| \}$ and $\max\{|(A+\alpha)B|, |A+C|\}$, $\alpha \neq 0$ in the regime when the sizes of finite subsets $A,B,C$ of a field differ significantly.

Find SimilarView on arXiv

Size of dot product sets determined by pairs of subsets of vector spaces over finite fields

January 27, 2014

85% Match
Doowon Koh, Youngjin Pi
Combinatorics

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F be subsets of the d-dimensional vector space F_q^d over a finite field F_q with q elements. As a new result, we prove that if E and F are subsets of the paraboloid and |E||F|\geq C q^d for some large C>1, then |\Pi(E,F)|\geq c q for some 0<c...

Find SimilarView on arXiv

On the structure of distance sets over prime fields

December 30, 2018

85% Match
Thang Pham, Andrew Suk
Combinatorics
Number Theory

Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in $\mathcal{E}$. Very recently, Iosevich, Koh, and Parshall (2018) proved that if $|\mathcal{E}|\gg q^{d/2}$, then the quotient set of $\Delta(\mathcal{E})$ satisfies \[\left\vert\frac{\Delta(\mathcal{E})}{\Delta(\mathcal{E})}\right\vert=\left\v...

Find SimilarView on arXiv

On iterated product sets with shifts II

June 5, 2018

85% Match
Brandon Hanson, Oliver Roche-Newton, Dmitrii Zhelezov
Number Theory
Classical Analysis and ODEs
Combinatorics

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here, $|A^{(k)}|$ denotes the $k$-fold product set $\{a_1\cdots a_k : a_1, \dots, a_k \in A \}$. Furthermore, our method of proof also gives the following $l_{\infty}$ sum-product estimate. For all $\gamma >0$ there exists a constant $C=C(\gamma...

Find SimilarView on arXiv

The sum-product estimate for large subsets of prime fields

June 5, 2007

85% 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