Searcharxiv⌕ Search

arXiv subjects

Oliver Roche-Newton

Publications and source records attributed to Oliver Roche-Newton.

At least 55 records · Page 3Linked to original sources

On sets with few distinct distances

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify this idea. Firstly, improving on a result of Hanson (see arXiv:1607.03442), it is proven that if $P= A \times A$ with $A \subset \mathbb R$ and $P$ determines $O(|A|^2)$ distinct distances, then $|A-A|=O\left(|A|^{2-\frac{2}{11}}\right)$. This result gives further evidence that cartesian products which determine few distinct distances have some additive structure. Secondly, it is shown that if a set $P \subset \mathbb R^2$ of $N$ points determines $O(N/\sqrt {\log N})$ distinct distances, then there exists a reflection $\mathcal R$ and a set $P' \subset P$ with $|P'| =Ω( \log^{3/2} N)$ such that $\mathcal R(P') \subset P$. In other words, sets with few distinct distances have some degree of reflexive symmetry.

math.MG↗

Expanders with superquadratic growth

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log^{\frac{17}{16}}|A|}, \\ \left|\frac{A+A}{A+A}+\frac{A}{A}\right| &\gg \frac{|A|^{2+\frac{2}{17}}}{\log^{\frac{16}{17}}|A|}, \\ \left|\frac{AA+AA}{A+A}\right| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log |A|}, \\ \left|\frac{AA+A}{AA+A}\right| &\gg \frac{|A|^{2+\frac{1}{8}}}{\log |A|}. \end{align*}

math.CO↗

On distinct perpendicular bisectors and pinned distances in finite fields

Given a set of points $P \subset \mathbb F_q^2$ such that $|P|\geq q^{3/2}$ it is established that $|P|$ determines $Ω(q^2)$ distinct perpendicular bisectors. It is also proven that, if $|P| \geq q^{4/3}$, then for a positive proportion of points $a \in P$, we have $$|\{\| a- b\|: b \in P\}|=Ω(q),$$ where $\|a- b\|$ is the distance between points $a$ and $b$. The latter result represents an improvement on a result of Chapman et al. (arxiv:0903.4218).

math.CO↗

On an application of Guth-Katz theorem

We prove that for some universal $c$, a non-collinear set of $N>\frac{1}{c}$ points in the Euclidean plane determines at least $c \frac{N}{\log N}$ distinct areas of triangles with one vertex at the origin, as well as at least $c \frac{N}{\log N}$ distinct dot products. This in particular implies a sum-product bound $$ |A\cdot A\pm A\cdot A|\geq c\frac{|A|^2}{\log |A|} $$ for a discrete $A \subset {\mathbb R}$.

math.CO↗

On discrete values of bilinear forms

This paper is an erratum to our paper, entitled "On an application of Guth-Katz theorem", Math. Res. Lett. 18 (2011), no. 4, 691-697. Let $F$ be the real or complex field and $ω$ a non-degenerate skew-symmetric bilinear form in the plane $F^2$. We prove that for finite a point set $P\subset F^2\setminus\{0\}$, the set $T_ω(P)$ of nonzero values of $ω$ in $P\times P$, if nonempty, has cardinality $Ω(N^{9/13}).$ A presumably near-sharp estimate $Ω(N/\log N)$ was claimed in the abovemnetioned paper over the reals for a symmetric or skew-symmetric form $ω$. However, the set-up for the proof was flawed. We discuss why we believe that justifying this claim in full strength is a major open problem. In the special case when $P=A\times A$, where $A$ is a set of at least two reals, we establish the following sum-product type estimates: $$ |AA+ AA|= Ω\left(|A|^{19/12}\right), $$ and $$|AA-AA|= Ω\left( \frac{|A|^{26/17}}{\log^{2/17}|A|}\right).$$

math.CO↗

If $(A+A)/(A+A)$ is small then the ratio set is large

In this paper, we consider the sum-product problem of obtaining lower bounds for the size of the set $$\frac{A+A}{A+A}:=\left \{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right\},$$ for an arbitrary finite set $A$ of real numbers. The main result is the bound $$\left| \frac{A+A}{A+A} \right| \gg \frac{|A|^{2+\frac{2}{25}}}{|A:A|^{\frac{1}{25}}\log |A|},$$ where $A:A$ denotes the ratio set of $A$. This improves on a result of Balog and the author (arXiv:1402.5775), provided that the size of the ratio set is subquadratic in $|A|$. That is, we establish that the inequality $$\left| \frac{A+A}{A+A} \right| \ll |A|^{2} \Rightarrow |A:A| \gg \frac{ |A|^2}{\log^{25}|A|} . $$ This extremal result answers a question similar to some conjectures in a recent paper of the author and Zhelezov (arXiv:1410.1156).

math.CO↗

New sum-product type estimates over finite fields

Let $F$ be a field with positive odd characteristic $p$. We prove a variety of new sum-product type estimates over $F$. They are derived from the theorem that the number of incidences between $m$ points and $n$ planes in the projective three-space $PG(3,F)$, with $m\geq n=O(p^2)$, is $$O( m\sqrt{n} + km ),$$ where $k$ denotes the maximum number of collinear planes. The main result is a significant improvement of the state-of-the-art sum-product inequality over fields with positive characteristic, namely that \begin{equation}\label{mres} |A\pm A|+|A\cdot A| =Ω\left(|A|^{1+\frac{1}{5}}\right), \end{equation} for any $A$ such that $|A|<p^{\frac{5}{8}}.$

math.CO↗

A short proof of a near-optimal cardinality estimate for the product of a sum set

In this note it is established that, for any finite set $A$ of real numbers, there exist two elements $a,b \in A$ such that $$|(a+A)(b+A)| \gg \frac{|A|^2}{\log |A|}.$$ In particular, it follows that $|(A+A)(A+A)| \gg \frac{|A|^2}{\log |A|}$. The latter inequality had in fact already been established in an earlier work of the author and Rudnev (arXiv:1203.6237), which built upon the recent developments of Guth and Katz (arXiv:1011.4105) in their work on the Erdős distinct distance problem. Here, we do not use those relatively deep methods, and instead we need just a single application of the Szemerédi-Trotter Theorem. The result is also qualitatively stronger than the corresponding sum-product estimate from (arXiv:1203.6237), since the set $(a+A)(b+A)$ is defined by only two variables, rather than four. One can view this as a solution for the pinned distance problem, under an alternative notion of distance, in the special case when the point set is a direct product $A \times A$. Another advantage of this more elementary approach is that these results can now be extended for the first time to the case when $A \subset \mathbb C$.

math.CO↗

Sets with few distinct distances do not have heavy lines

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances, equivalent to distances in the Minkowski plane, where the distance between a pair of points is the area of the axis-parallel rectangle that they span.

math.CO↗

A bound on the multiplicative energy of a sum set and extremal sum-product problems

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool is a new result which provides a nontrivial upper bound on the multiplicative energy of a sum set or difference set.

math.CO↗

Elementary methods for incidence problems in finite fields

We use elementary methods to prove an incidence theorem for points and spheres in $\mathbb{F}_q^n$. As an application, we show that any point set of $P\subset \mathbb{F}_q^2$ with $|P|\geq 5q$ determines a positive proportion of all circles. The latter result is an analogue of Beck's Theorem for circles which is optimal up to multiplicative constants.

math.CO↗

Polynomial Values in Subfields and Affine Subspaces of Finite Fields

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper subfield of ${\mathbb F}_{q^r}$. We also obtain similar results for elements in affine subspaces of ${\mathbb F}_{q^r}$, considered as a linear space over ${\mathbb F}_q$.

math.NT↗

Sum-ratio estimates over arbitrary finite fields

The aim of this note is to record a proof that the estimate $$\max{\{|A+A|,|A:A|\}}\gg{|A|^{12/11}}$$ holds for any set $A\subset{\mathbb{F}_q}$, provided that $A$ satisfies certain conditions which state that it is not too close to being a subfield. An analogous result was established in \cite{LiORN}, with the product set $A\cdot{A}$ in the place of the ratio set $A:A$. The sum-ratio estimate here beats the sum-product estimate in \cite{LiORN} by a logarithmic factor, with slightly improved conditions for the set $A$, and the proof is arguably a little more intuitive. The sum-ratio estimate was mentioned in \cite{LiORN}, but a proof was not given.

math.CO↗

New sum-product estimates for real and complex numbers

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite set $A$ of positive real numbers, it is true that $$\left|\left\{\frac{a+b}{c+d}:a,b,c,d\in{A}\right\}\right|\geq{2|A|^2-1}.$$ As a consequence of this result, it is also established that $$|4^{k-1}A^{(k)}|:=|\underbrace{\underbrace{A\cdots{A}}_\textrm{k times}+\cdots{+A\cdots{A}}}_\textrm{$4^{k-1}$ times}|\geq{|A|^k}.$$ Later on, it is shown that both of these bounds hold in the case when $A$ is a finite set of complex numbers, although with smaller multiplicative constants.

math.CO↗

Variations on the Sum-Product Problem

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that $$|A(A+A+A+A)|\gg{\frac{|A|^2}{\log{|A|}}},$$ a bound which is optimal up to constant and logarithmic factors. We also prove several new results concerning sum-product estimates and expanders, for example, showing that $$|A(A+a)|\gg{|A|^{3/2}}$$ holds for a typical element of $A$.

math.CO↗

On the Minkowski distances and products of sum sets

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate $Ω(\frac{N}{\log{N}})$ distinct distances, or all the distances are zero. The proof follows the lines of the Elekes/Sharir/Guth/Katz approach to the Erd\H os distance problem, analysing the 3D incidence problem, arising by considering the action of the Minkowski isometry group $ISO^*(1,1)$. The signature of the metric creates an obstacle to applying the Guth/Katz incidence theorem to the 3D problem at hand, since one may encounter a high count of congruent line intervals, lying on null lines, or "light cones", all these intervals having zero Minkowski length. In terms of the Guth/Katz theorem, its condition of the non-existence of "rich planes" generally gets violated. It turns out, however, that one can efficiently identify and discount incidences, corresponding to null intervals and devise a counting strategy, where the rich planes condition happens to be just ample enough for the strategy to succeed. As a corollary we establish the following near-optimal sum-product type estimate for finite sets $A,B\subset \R$, with more than one element: $$|(A\pm{B})\cdot{(A\pm{B})}|\gg{\frac{|A||B|}{\log{|A|}+\log{|B|}}}.$$

math.CO↗

Improved bounds on the set A(A+1)

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show that A(A+1) is of cardinality at least C|A|^{57/56-o(1)} for some absolute constant C, so long as |A| < p^{1/2}. In the real case we show that the cardinality is at least C|A|^{24/19-o(1)}. These improve on the previously best-known exponents of 106/105-o(1) and 5/4 respectively.

math.CO↗

Convexity and a sum-product type estimate

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In particular, we show that for any finite set $A\subset{\mathbb{R}}$ and any strictly convex or concave function $f$, \[|A+f(A)|\gg{\frac{|A|^{24/19}}{(\log|A|)^{2/19}}}\] and \[\max\{|A-A|,\ |f(A)+f(A)|\}\gg{\frac{|A|^{14/11}}{(\log|A|)^{2/11}}}.\] For the latter of these inequalities, we go on to consider the consequences for a sum-product type problem.

math.CO↗