activity
20112023
most citedA short proof of a near-optimal cardinality estimate for the product of a sum set

11 citations · 15 across the 7 of their papers we have counts for

collaborators

19 papers

math.MG20231 cited

Convexity, Elementary Methods, and Distances

Oliver Roche-Newton, Dmitrii Zhelezov

This paper considers an extremal version of the Erdős distinct distances problem. For a point set , let denote the set of all Euclidean distances dete…

math.CO2022

Counting arcs in

Krishnendu Bhowmick, Oliver Roche-Newton

An arc in is a set such that no three points of are collinear. We use the method of hypergraph containers to prove several counting re…

math.CO20211 cited

Convexity, Superquadratic Growth, and Dot Products

Brandon Hanson, Oliver Roche-Newton, Steven Senger

Let be a point set with cardinality . We give an improved bound for the number of dot products determined by , proving that, \[ |\{ p \cdot q :p,q \in…

math.CO2021

Additive and multiplicative Sidon sets

Oliver Roche-Newton, Audie Warren

We give a construction of a set such that any subset with is neither an additive nor multiplicative Sidon set. In doing so…

math.CO2020

The Elekes-Szabó Problem and the Uniformity Conjecture

Mehdi Makhul, Oliver Roche-Newton, Sophie Stevens +1

In this paper we give a conditional improvement to the Elekes-Szabó problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}…

math.CO2020

Sums, products and dilates on sparse graphs

Oliver Roche-Newton

Let and . We prove that, for any , \[ \max \{|A+_G A|, |A+_G λA|, |A\cdot_G A|\} \gg |G|^{6/11}. \]