English
Related papers

Related papers: A Second Wave of Expanders over Finite Fields

200 papers

The purpose of this article is to further explore how the structure of the affine group can be used to deduce new incidence theorems, and to explore sum-product type applications of these incidence bounds, building on the recent work of…

Combinatorics · Mathematics 2019-05-10 Oliver Roche-Newton , Audie Warren

This thesis establishes new quantitative records in several problems of incidence geometry and growth. After the necessary background in Chapters 1, 2 and 3, the following results are proven. Chapter 4 gives new results in the incidence…

Combinatorics · Mathematics 2016-11-04 Timothy G. F. Jones

We prove a range of new sum-product type growth estimates over a general field $\mathbb{F}$, in particular the special case $\mathbb{F}=\mathbb{F}_p$. They are unified by the theme of "breaking the $3/2$ threshold", epitomising the previous…

Combinatorics · Mathematics 2019-05-22 Brendan Murphy , Giorgis Petridis , Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We…

Combinatorics · Mathematics 2018-12-27 Matthew Hase-Liu , Adam Sheffer

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…

Combinatorics · Mathematics 2011-06-07 Liangpan Li , Oliver Roche-Newton

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 classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

Classical Analysis and ODEs · Mathematics 2009-12-30 Chun-Yen Shen

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 \[…

Combinatorics · Mathematics 2021-04-05 Ali Mohammadi , Sophie Stevens

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

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

We improve the range of exponents for the restriction problem for the 3-d paraboloid over finite fields. The key new ingredient is a variant of the Bourgain-Katz-Tao finite field incidence theorem derived from sum-product estimates. In…

Classical Analysis and ODEs · Mathematics 2016-06-01 Mark Lewko

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

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…

Combinatorics · Mathematics 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

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

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…

Number Theory · Mathematics 2018-03-06 Ilya D. Shkredov

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…

Combinatorics · Mathematics 2016-09-06 Oliver Roche-Newton , Misha Rudnev , Ilya D. Shkredov

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

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
‹ Prev 1 2 3 10 Next ›