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
Research Subjects
Research Interests
Oliver Roche-Newton has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Ilya Dmitrievich Shkredov
Department of Mathematics , Purdue University , 150 N. University Street , West Lafayette , IN 47907–2067 , USA
11 shared publications - Audie Warren
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria
8 shared publications - Dmitrii Zhelezov
Alfred Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary
8 shared publications - Misha Rudnev
University of Bristol
8 shared publications - Brandon Hanson
University of Maine
5 shared publications - Alex Iosevich
Department of Mathematics, University of Rochester, Rochester, USA
4 shared publications
Latest Publications
- Open Access
- 28 January 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (1) , 7
Additive Structure in Convex Sets
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})$$ three-term arithmetic progressions.- 28 January 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (1) , 7
Open AccessAdditive Structure in Convex Sets
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})$$ three-term arithmetic progressions. - Open Access
Additive structure in convex sets
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 AccessAdditive structure in convex sets
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
- 7 March 2025
- Published by Springer Nature in Combinatorica
- Vol. 45 (2) , 1-13
A Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set
We prove that, for any $$B \subset {\mathbb {R}}$$ , the Cartesian product set $$B \times B$$ determines $$\Omega (|B|^{2+c})$$ distinct angles.- 7 March 2025
- Published by Springer Nature in Combinatorica
- Vol. 45 (2) , 1-13
Open AccessA Lower Bound for the Number of Pinned Angles Determined by a Cartesian Product Set
We prove that, for any $$B \subset {\mathbb {R}}$$ , the Cartesian product set $$B \times B$$ determines $$\Omega (|B|^{2+c})$$ distinct angles. - 10 May 2024
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 177 (1) , 11-22
A better than $3/2$ exponent for iterated sums and products over $\mathbb R$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.- 10 May 2024
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 177 (1) , 11-22
A better than $3/2$ exponent for iterated sums and products over $\mathbb R$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.- 3 February 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (2) , 437-446
Convexity, Elementary Methods, and Distances
- 3 February 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 73 (2) , 437-446
Convexity, Elementary Methods, and Distances
- Open Access
- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.3
Convexity, Squeezing, and the Elekes-Szabó Theorem
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.- 12 January 2024
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 31 (1) , P1.3
Open AccessConvexity, Squeezing, and the Elekes-Szabó Theorem
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
- 8 January 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 72 (4) , 1630-1646
Counting Arcs in ${\mathbb {F}}_q^2$An arc in $$\mathbb F_q^2$$ is a set $$P \subset \mathbb 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)$$ denote the family of all arcs in $$\mathbb F_q^2$$ . Our main result is the bound $$\begin{aligned} |{\mathcal {A}}(q)| \le 2^{(1+o(1))q}. \end{aligned}$$ 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$$ , and let $${\mathcal {A}}(q,k)$$ denote the family of all arcs in $$\mathbb 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}$$ 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}$$ follows by considering all subsets of size k of an arc of size q.- 8 January 2024
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 72 (4) , 1630-1646
Open AccessCounting Arcs in ${\mathbb {F}}_q^2$An arc in $$\mathbb F_q^2$$ is a set $$P \subset \mathbb 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)$$ denote the family of all arcs in $$\mathbb F_q^2$$ . Our main result is the bound $$\begin{aligned} |{\mathcal {A}}(q)| \le 2^{(1+o(1))q}. \end{aligned}$$ 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$$ , and let $${\mathcal {A}}(q,k)$$ denote the family of all arcs in $$\mathbb 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}$$ 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}$$ follows by considering all subsets of size k of an arc of size q. - Open Access
Convexity, Elementary Methods, and Distances
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 AccessConvexity, Elementary Methods, and Distances
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
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 AccessLarge Convex sets in Difference sets
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
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.Open AccessLocal Differences Determined by Convex sets
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.