arXiv subjects
Publications and source records attributed to J. Solymosi.
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}$.
A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $Ω(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show that a homogeneous set of $n$ points determines at least $Ω(n^{.6091})$ distinct distances.
We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to the constant multiplier.
Consider the following problem: how many collinear triples of points must a transversal of (Z/nZ)^2 have? This question is connected with venerable issues in discrete geometry. We show that the answer, for n prime, is between (n-1)/4 and (n-1)/2, and consider an analogous question for collinear quadruples. We conjecture that the upper bound is the truth and suggest several other interesting problems in this area.