BMBrendan Murphy

Brendan Murphy

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Brendan Murphy has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Growth in linear groups

    by Sean Eberhard, Brendan Murphy, László Pyber, Endre Szabó

    We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq K|A|$. Then there are subgroups $H \trianglelefteq \Gamma \trianglelefteq \langle A \rangle$ such that $A$ is covered by $K^{O_n(1)}$ cosets of $\Gamma$, $\Gamma/H$ is nilpotent of step at most $n-1$, and $H$ is contained in $A^{O_n(1)}$. This theorem includes the Product Theorem for finite simple groups of bounded rank as a special case. As an application of our methods we also show that the diameter of sufficiently quasirandom finite linear groups is poly-logarithmic.

  • Open Access

    On the Pinned Distances Problem in Positive Characteristic

    by Brendan Murphy, Giorgis Petridis, Thang Pham, Misha Rudnev, Sophie Stevens

    We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$ determines an asymptotically full proportion of the feasible $p$ distances. For small sets $A$, namely when $|A|\leq p^{4/3}$ over any $\mathbb{F}$, we prove that either $A$ determines $\gg|A|^{2/3}$. For both large and small sets, the results proved are in fact for pinned distances.

  • Popular products and continued fractions

    by Nikolay Moshchevitin, Brendan Murphy, Ilya Shkredov


  • Open Access

    Bisector energy and pinned distances in positive characteristic

    by Brendan Murphy, Misha Rudnev, Sophie Stevens

    We prove a new lower bound for the number of pinned distances over finite fields: if $A$ is a sufficiently small subset of $\mathbb{F}_q^2$, then there is an element in $A$ that determines $\gg |A|^{2/3}$ distinct distances to other elements of $A$. Combined with results for large subsets $A\subseteq\mathbb{F}_q^2$, this improves all previously known lower bounds on distinct distances over finite fields. In fact, we obtain an upper bound for the number of isosceles triangles determined by $A$. For that we use the concept of bisector energy. It turns out that the latter can be expressed as a point-plane incidence bound, so one can use a theorem of the third author. The conversion to this incidence problem relies on the Blaschke-Gr\"unwald kinematic mapping -- an embedding of the group of rigid motions of $\mathbb{F}_q^2$ into an open subset of the projective three space. This has long been known in kinematics and geometric algebra; we provide a proof for arbitrary fields using Clifford algebras.

  • Open Access

    New results on sum-product type growth over fields

    by Brendan Murphy, Giorgis Petridis, Oliver Roche-Newton, Misha Rudnev, Ilya D. Shkredov

    We prove a range of new sum-product type growth estimates over a general field $\mathbb{F}$, in particular the special case $\mathbb{F}=\mathbb{F}_p$. They are unified by the theme of "breaking the $3/2$ threshold", epitomising the previous state of the art. These estimates stem from specially suited applications of incidence bounds over $\mathbb{F}$, which apply to higher moments of representation functions. We establish the estimate $|R[A]| \gtrsim |A|^{8/5}$ for cardinality of the set $R[A]$ of distinct cross-ratios defined by triples of elements of a (sufficiently small if $\mathbb{F}$ has positive characteristic, similarly for the rest of the estimates) set $A\subset \mathbb{F}$, pinned at infinity. The cross-ratio naturally arises in various sum-product type questions of projective nature and is the unifying concept underlying most of our results. It enables one to take advantage of its symmetry properties as an onset of growth of, for instance, products of difference sets. The geometric nature of the cross-ratio enables us to break the version of the above threshold for the minimum number of distinct triangle areas $Ouu'$, defined by points $u,u'$ of a non-collinear point set $P\subset \mathbb{F}^2$. Another instance of breaking the threshold is showing that if $A$ is sufficiently small and has additive doubling constant $M$, then $|AA|\gtrsim M^{-2}|A|^{14/9}$. This result has a second moment version, which allows for new upper bounds for the number of collinear point triples in the set $A\times A\subset \mathbb{F}^2$, the quantity often arising in applications of geometric incidence estimates.

  • Open Access

    An example related to the Erdos-Falconer question over arbitrary finite fields

    by Brendan Murphy, Giorgis Petridis

    There exists an infinite family of examples of subsets of $\mathbb{F}_q^2$ with $q^{4/3}$ elements whose distance sets are not the whole of $\mathbb{F}_q$.

  • Top Cited Papers

    NEW RESULTS ON SUM‐PRODUCT TYPE GROWTH OVER FIELDS

    by Brendan Murphy, Giorgis Petridis, Oliver Roche‐Newton, Misha Rudnev, Ilya D. Shkredov


  • Open Access

    Popular Products and Continued Fractions

    by Nikolay Moshchevitin, Brendan Murphy, Ilya Shkredov

    We prove bounds for the popularity of products of sets with weak additive structure, and use these bounds to prove results about continued fractions. Namely, we obtain a nearly sharp upper bound for the cardinality of Zaremba's set modulo $p$.

  • Open Access

    On the few products, many sums problem

    by Brendan Murphy, Misha Rudnev, Ilya D. Shkredov, Yurii N. Shteinikov

    We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are based on new combinatorial lemmata, which may be of independent interest. Our main results are the inequality $$ |A-A|^3|AA|^5 \gtrsim |A|^{10}, $$ over the reals, "redistributing" the exponents in the textbook Elekes sum-product inequality and the new best known additive energy bound $\mathsf E(A)\lesssim_M |A|^{49/20}$, which aligns, in a sense to be discussed, with the best known sum set bound $|A+A|\gtrsim_M |A|^{8/5}$. These bounds, with $M=1$, also apply to multiplicative subgroups of $\mathbb F^\times_p$, whose order is $O(\sqrt{p})$. We adapt the above energy bound to larger subgroups and obtain new bounds on gaps between elements in cosets of subgroups of order $\Omega(\sqrt{p})$.

  • Open Access

    Variations on the sum-product problem II

    by Brendan Murphy, Oliver Roche-Newton, Ilya Shkredov

    This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set $A \subset \mathbb R$, there exists $a \in A$ such that $|A(A+a)| \gtrsim |A|^{\frac{3}{2}+\frac{1}{186}}$. We give improved bounds for the cardinalities of $A(A+A)$ and $A(A-A)$. Also, we prove that $|\{(a_1+a_2+a_3+a_4)^2+\log a_5 : a_i \in A \}| \gg \frac{|A|^2}{\log |A|}$. The latter result is optimal up to the logarithmic factor.