N. Katz

activity

19992018

most citedOn the Erdos distinct distance problem in the plane

105 citations · 168 across the 11 of their papers we have counts for

collaborators

Showing 2011Show all

2 papers · 1 filter

math.CO2011★ 12 cited

Structure in additively nonsmoothing sets

Michael Bateman, Nets Hawk Katz

Sets with many additive quadruples are guaranteed to have many additive octuples, by Hölder's inequality. Sets with not many more than this are said to be additively nonsmoothing.…

math.CA2011

New Bounds on cap sets

Michael Bateman, Nets Hawk Katz

We provide an improvement over Meshulam's bound on cap sets in $F_{3}^{N}$ . We show that there exist universal $ε > 0$ and $C > 0$ so that any cap set in $F_{3}^{N}$ has size at most $C {3^N \…