pith. sign in

arxiv: 1103.1354 · v5 · pith:ZNVLAFLZnew · submitted 2011-03-07 · 🧮 math.CO · math.CA· math.NT

On an application of Guth-Katz theorem

classification 🧮 math.CO math.CAmath.NT
keywords fraccdotdistinctleastapplicationareasbounddetermines
0
0 comments X
read the original abstract

We prove that for some universal $c$, a non-collinear set of $N>\frac{1}{c}$ points in the Euclidean plane determines at least $c \frac{N}{\log N}$ distinct areas of triangles with one vertex at the origin, as well as at least $c \frac{N}{\log N}$ distinct dot products. This in particular implies a sum-product bound $$ |A\cdot A\pm A\cdot A|\geq c\frac{|A|^2}{\log |A|} $$ for a discrete $A \subset {\mathbb R}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.