English
Related papers

Related papers: New results on sum-product type growth over fields

200 papers

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…

Combinatorics · Mathematics 2018-07-31 Changhao Chen , Bryce Kerr , Ali Mohammadi

For $A\subseteq \mathbb{R}$, let $A+A=\{a+b: a,b\in A\}$ and $AA=\{ab: a,b\in A\}$. For $k\in \mathbb{N}$, let $SP(k)$ denote the minimum value of $\max\{|A+A|, |AA|\}$ over all $A\subseteq \mathbb{N}$ with $|A|=k$. Here we establish…

Combinatorics · Mathematics 2025-01-29 Ginny Ray Clevenger , Haley Havard , Patch Heard , Andrew Lott , Alex Rice , Brittany Wilson

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…

Combinatorics · Mathematics 2019-03-25 Esen Aksoy Yazici

We study the growth of product sets in some finite three-dimensional matrix groups. In particular, we prove two results about the group of $2\times 2$ upper triangular matrices over arbitrary finite fields: a product set estimate using…

Combinatorics · Mathematics 2020-05-12 Brendan Murphy , James Wheeler

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

Combinatorics · Mathematics 2017-04-05 Brendan Murphy , Oliver Roche-Newton , Ilya Shkredov

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,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We use the theory of cross ratios to construct a real-valued function f of only three variables with the property that for any finite set A of reals, the set f(A) = {f(a,b,c):a,b,c \in A} has cardinality at least C|A|^2/log|A|, for an…

Combinatorics · Mathematics 2012-02-23 Timothy G. F. Jones

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},…

Combinatorics · Mathematics 2019-08-14 Audie Warren

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

Combinatorics · Mathematics 2011-11-23 Liangpan Li , Oliver Roche-Newton

We provide a new exponent for the Sum-Product conjecture on $\mathbb{R} $. Namely for $A \subset \mathbb{R}$ finite, \[ \max \left\{ \left\lvert A+A \right\rvert , \left\lvert AA \right\rvert \right\} \gg_{\epsilon} \left\lvert A…

Combinatorics · Mathematics 2026-02-02 Adam Cushman

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

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…

Number Theory · Mathematics 2009-07-14 Liangpan Li

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

Number Theory · Mathematics 2023-09-19 Lior Bary-Soroker , Noam Goldgraber

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a…

Combinatorics · Mathematics 2014-01-09 Brendan Murphy , Oliver Roche-Newton , Ilya D. Shkredov

We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$…

Combinatorics · Mathematics 2022-06-14 Chengfei Xie , Gennian Ge

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…

Combinatorics · Mathematics 2024-02-27 Jozsef Solymosi , Joshua Zahl

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

Combinatorics · Mathematics 2007-05-23 Van Vu

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…

Combinatorics · Mathematics 2007-05-23 D. Hart , A. Iosevich , J. Solymosi

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

Combinatorics · Mathematics 2017-08-16 Sophie Stevens , Frank de Zeeuw

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman