1 citations · 1 across the 15 of their papers we have counts for
18 papers
One Arithmetic Gadget, Two Problems
Jozsef Solymosi
There is an absolute constant such that, for every , arbitrarily large finite sets satisfy \[ |A+A|\leq |A|^{1+\varepsilon},\qquad |A…
Large solution-free sets via combinatorial degenerations
Paul Hametner, Jozsef Solymosi
Consider the linear form . For a positive integer , denote by the largest size of a subset of that avoids nontrivial solution…
A Salem-Spencer-Type Construction for Large Subsets of Integer Grids with No Isosceles Right Triangles
Gyula Károlyi, Jozsef Solymosi
Let be the largest size of a subset of containing no nondegenerate isosceles right triangle. We give a modified Salem--Spencer-type construction over…
Distances in Planar Integral Point Sets
Jozsef Solymosi
We show that very small distances in a planar integral point set are essentially one-dimensional. Let P be a non-collinear set of n points in the plane, all of whose pairwise dista…
A Simple Counting Argument for Dense Linear Hypergraphs
Lior Gishboliner, József Solymosi
In connection to the Brown-Erdős-Sós conjecture, we give a short local averaging proof of a density theorem for linear uniform hypergraphs. Let , , and suppose th…
On the number of pairwise touching cylinders in
Jozsef Solymosi, Josh Zahl
John E. Littlewood posted the question {\em ``Is it possible in 3-space for seven infinite circular cylinders of unit radius each to touch all the others? Seven is the number sugge…