OROliver Roche-Newton

Oliver Roche-Newton

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Oliver Roche-Newton has a total of 47 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Additive Structure in Convex Sets

    by Thomas F. Bloom, Jakob Führer, Oliver Roche-Newton

    This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set A containing $$\Omega (|A|^{3/2})$$ Ω ( | A | 3 / 2 ) three-term arithmetic progressions.

  • Open Access

    Additive structure in convex sets

    by Thomas F. Bloom, Jakob Führer, Oliver Roche-Newton

    This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $Ω(|A|^{3/2})$ three-term arithmetic progressions.

  • Open Access

    A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set

    by Oliver Roche-Newton

    We prove that, for any $$B \subset {\mathbb {R}}$$ B ⊂ R , the Cartesian product set $$B \times B$$ B × B determines $$\Omega (|B|^{2+c})$$ Ω ( | B | 2 + c ) distinct angles.


  • A better than $3/2$ exponent for iterated sums and products over $\mathbb R$

    by Oliver Roche–Newton

    In this paper, we prove that the bound \begin{equation*}\max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}}\end{equation*} holds for all $A \subset \mathbb R$ , and for all convex functions f which satisfy an additional technical condition. This technical condition is satisfied by the logarithmic function, and this fact can be used to deduce a sum-product estimate \begin{equation*}\max \{ |16A|, |A^{(16)}| \} \gg |A|^{\frac{3}{2} + c},\end{equation*} for some $c\gt 0$ . Previously, no sum-product estimate over $\mathbb R$ with exponent strictly greater than $3/2$ was known for any number of variables. Moreover, the technical condition on f seems to be satisfied for most interesting cases, and we give some further applications. In particular, we show that \begin{equation*}|AA| \leq K|A| \implies \,\forall d \in \mathbb R \setminus \{0 \}, \,\, |\{(a,b) \in A \times A : a-b=d \}| \ll K^C |A|^{\frac{2}{3}-c^{\prime}},\end{equation*} where $c,C \gt 0$ are absolute constants.


  • Convexity, Elementary Methods, and Distances

    by Oliver Roche-Newton, Dmitrii Zhelezov


  • Open Access

    Convexity, Squeezing, and the Elekes-Szabó Theorem

    by Oliver Roche-Newton, Elaine Wong

    This paper explores the relationship between convexity and sum sets. In particular, we show that elementary number theoretical methods, principally the application of a squeezing principle, can be augmented with the Elekes-Szabó Theorem in order to give new information. Namely, if we let $A \subset \mathbb R$, we prove that there exist $a,a' \in A$ such that\[\left | \frac{(aA+1)^{(2)}(a'A+1)^{(2)}}{(aA+1)^{(2)}(a'A+1)} \right | \gtrsim |A|^{31/12}.\]We are also able to prove that\[\max \{|A+ A-A|, |A^2+A^2-A^2|, |A^3 + A^3 - A^3|\} \gtrsim |A|^{19/12}.\]Both of these bounds are improvements of recent results and takes advantage of computer algebra to tackle some of the computations.


  • Open Access

    Counting Arcs in ${\mathbb {F}}_q^2$

    by Krishnendu Bhowmick, Oliver Roche-Newton

    An arc in $$\mathbb F_q^2$$ F q 2 is a set $$P \subset \mathbb F_q^2$$ P ⊂ F q 2 such that no three points of P are collinear. We use the method of hypergraph containers to prove several counting results for arcs. Let $${\mathcal {A}}(q)$$ A ( q ) denote the family of all arcs in $$\mathbb F_q^2$$ F q 2 . Our main result is the bound $$\begin{aligned} |{\mathcal {A}}(q)| \le 2^{(1+o(1))q}. \end{aligned}$$ | A ( q ) | ≤ 2 ( 1 + o ( 1 ) ) q . This matches, up to the factor hidden in the o(1) notation, the trivial lower bound that comes from considering all subsets of an arc of size q. We also give upper bounds for the number of arcs of a fixed (large) size. Let $$k \ge q^{2/3}(\log q)^3$$ k ≥ q 2 / 3 ( log q ) 3 , and let $${\mathcal {A}}(q,k)$$ A ( q , k ) denote the family of all arcs in $$\mathbb F_q^2$$ F q 2 with cardinality k. We prove that $$\begin{aligned} |{\mathcal {A}}(q,k)| \le \left( {\begin{array}{c}(1+o(1))q\\ k\end{array}}\right) . \end{aligned}$$ | A ( q , k ) | ≤ ( 1 + o ( 1 ) ) q k . This result improves a bound of Roche-Newton and Warren [12]. A nearly matching lower bound $$\begin{aligned} |{\mathcal {A}}(q,k)| \ge \left( {\begin{array}{c}q\\ k\end{array}}\right) \end{aligned}$$ | A ( q , k ) | ≥ q k follows by considering all subsets of size k of an arc of size q.


  • Open Access

    Convexity, Elementary Methods, and Distances

    by Oliver Roche-Newton, Dmitrii Zhelezov

    This paper considers an extremal version of the Erdős distinct distances problem. For a point set $P \subset \mathbb R^d$, let $Δ(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if $Δ(A^d) \ll |A|^2$ and $d \geq 5$, then there exists $A' \subset A$ with $|A'| \geq |A|/2$ such that $|A'-A'| \ll |A| \log |A|$. This is one part of a more general result, which says that, if the growth of $|Δ(A^d)|$ is restricted, it must be the case that $A$ has some additive structure. More specifically, for any two integers $k,n$, we have the following information: if \[ | Δ(A^{2k+3})| \leq |A|^n \] then there exists $A' \subset A$ with $|A'| \geq |A|/2$ and \[ | kA'- kA'| \leq k^2|A|^{2n-3}\log|A|. \] These results are higher dimensional analogues of a result of Hanson, who considered the two-dimensional case.

  • Open Access

    Large Convex sets in Difference sets

    by Krishnendu Bhowmick, Ben Lund, Oliver Roche-Newton

    We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $Ω(n^2)$. We also consider the following variant of this problem: given a convex set $A$, what is the size of the largest matching $M \subset A \times A$ such that the set \[ \{ a-b : (a,b) \in M \} \] is convex? We prove that there always exists such an $M$ with $|M| \geq \sqrt n$, and that this lower bound is best possible, up a multiplicative constant.

  • Open Access

    Local Differences Determined by Convex sets

    by Krishnendu Bhowmick, Miriam Patry, Oliver Roche-Newton

    This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to the size of $S$ and the parameter $i$, for any convex set $S$. We give a construction to show that $D_3(S)$ can be as small as $n+2$, and show that this is the smallest possible size. On the other hand, we use an elementary argument to prove a non-trivial lower bound for $D_4(S)$, namely $|D_4(S)| \geq \frac{5}{4}n -1$. For sufficiently large values of $i$, we are able to prove a non-trivial bound that grows with $i$ using incidence geometry.