ID: 1602.03473

New results on sum-products in R

February 10, 2016

View on ArXiv

Similar papers 5

Convexity and a sum-product type estimate

November 22, 2011

85% Match
Liangpan Li, Oliver Roche-Newton
Combinatorics

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 particular, we show that for any finite set $A\subset{\mathbb{R}}$ and any strictly convex or concave function $f$, \[|A+f(A)|\gg{\frac{|A|^{24/19}}{(\log|A|)^{2/19}}}\] and \[\max\{|A-A|,\ |f(A)+f(A)|\}\gg{\frac{|A|^{14/11}}{(\log|A|)^{2/11}}}....

Find SimilarView on arXiv

Asymmetric estimates and the sum-product problems

May 20, 2020

85% Match
Boqing Xue
Number Theory

We show two asymmetric estimates, one on the number of collinear triples and the other on that of solutions to $(a_1+a_2)(a_1^{\prime\prime\prime}+a_2^{\prime\prime\prime})=(a_1^\prime+a_2^\prime)(a_1^{\prime\prime}+a_2^{\prime\prime})$. As applications, we improve results on difference-product/division estimates and on Balog-Wooley decomposition: For any finite subset $A$ of $\mathbb{R}$, \[ \max\{|A-A|,|AA|\} \gtrsim |A|^{1+105/347},\quad \max\{|A-A|,|A/A|\} \gtrsim |A|^{1+...

Find SimilarView on arXiv

Sum-product estimates in finite fields

September 15, 2006

84% 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 for diagonal matrices

May 27, 2020

84% Match
Akshat Mudgal
Combinatorics
Number Theory

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d \times d$ diagonal matrices with real entries. Then for all $\delta_1 < 1/3 + 5/5277$, we have \[ |A+A| + |A\cdot A| \gg_{d} |A|^{1 + \delta_{1}/d}. \] In this setting, the above estimate quantitatively strengthens a result of Chang.

Find SimilarView on arXiv

Growth in Sumsets of Higher Convex Functions

November 5, 2021

84% Match
Peter J. Bradshaw
Number Theory
Combinatorics

The main results of this paper concern growth in sums of a $k$-convex function $f$. Firstly, we streamline the proof of a growth result for $f(A)$ where $A$ has small additive doubling, and improve the bound by removing logarithmic factors. The result yields an optimal bound for \[ |2^k f(A) - (2^k-1)f(A)|. \] We also generalise a recent result of Hanson, Roche-Newton and Senger, by proving that for any finite $A\subset \mathbb{R}$ \[ | 2^k f(sA-sA) - (2^k-1) f(sA-sA)| \g...

Find SimilarView on arXiv

Breaking the 6/5 threshold for sums and products modulo a prime

June 19, 2018

84% Match
G. Shakan, I. D. Shkredov
Combinatorics
Number Theory

Let $A \subset \mathbb{F}_p$ of size at most $p^{3/5}$. We show $$|A+A| + |AA| \gtrsim |A|^{6/5 + c},$$ for $c = 4/305$. Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher energies developed by the second author.

Find SimilarView on arXiv

On sets with small additive doubling in product sets

February 12, 2015

84% Match
Dmitry Zhelezov
Number Theory

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is asymptotically $o(|B|^6)$. In particular, we extend to sets of small doubling and polynomial growth the classical Multiplication Table theorem of Erd\H{o}s saying that $|[1..n]. [1..n]| = o(n^2)$.

Find SimilarView on arXiv

On the discretized sum-product problem

April 6, 2018

84% Match
Larry Guth, Nets Hawk Katz, Joshua Zahl
Classical Analysis and ODEs
Combinatorics
Metric Geometry

We give a new proof of the discretized ring theorem for sets of real numbers. As a special case, we show that if $A\subset\mathbb{R}$ is a $(\delta,1/2)_1$-set in the sense of Katz and Tao, then either $A+A$ or $A.A$ must have measure at least $|A|^{1-\frac{1}{68}}$

Find SimilarView on arXiv

New sum-product estimates for real and complex numbers

February 24, 2014

84% Match
Antal Balog, Oliver Roche-Newton
Combinatorics
Number Theory

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite set $A$ of positive real numbers, it is true that $$\left|\left\{\frac{a+b}{c+d}:a,b,c,d\in{A}\right\}\right|\geq{2|A|^2-1}.$$ As a consequence of this result, it is also established that $$|4^{k-1}A^{(k)}|:=|\underbrace{\underbrace{A\cdots{A...

Find SimilarView on arXiv

Sum-Product Type Estimates for Subsets of Finite Valuation Rings

January 27, 2017

84% Match
Esen Aksoy Yazici
Combinatorics

Let $R$ be a finite valuation ring of order $q^r.$ Using a point-plane incidence estimate in $R^3$, we obtain sum-product type estimates for subsets of $R$. In particular, we prove that for $A\subset R$, $$|AA+A|\gg \min\left\{q^{r}, \frac{|A|^3}{q^{2r-1}}\right\}.$$ We also show that if $|A+A||A|^{2}>q^{3r-1}$, then $$|A^2+A^2||A+A|\gg q^{\frac{r}{2}}|A|^{\frac{3}{2}}.$$

Find SimilarView on arXiv