Searcharxiv⌕ Search

arXiv subjects

Joseph MacManus

Publications and source records attributed to Joseph MacManus.

7 recordsLinked to original sources
arXiv2026

Realising all countable groups as quasi-isometry groups

Given any countable group $G$, we construct uncountably many quasi-isometry classes of proper geodesic metric spaces with quasi-isometry group isomorphic to $G$. Moreover, if the group $G$ is a hyperbolic group, the spaces we construct are hyperbolic metric spaces. We make use of a rigidity phenomenon for quasi-isometries exhibited by many symmetric spaces, called strong quasi-isometric rigidity. Our method involves the construction of new examples of strongly quasi-isometrically rigid spaces, arising as graphs of strongly quasi-isometrically rigid rank-one symmetric spaces.

math.GR↗
arXiv2024

Fat minors in finitely presented groups

We show that a finitely presented group virtually admits a planar Cayley graph if and only if it is asymptotically minor-excluded, partially answering a conjecture of Georgakopoulos and Papasoglu in the affirmative.

math.GR↗
arXiv2024

The metric Menger problem

We study a generalization of the well-known disjoint paths problem which we call the metric Menger problem, denoted MM(r,k), where one is given two subsets of a graph and must decide whether they can be connected by $k$ paths of pairwise distance at least $r$. We prove that this problem is NP-complete for every $r\geq 3$ and $k\geq 2$ by giving a reduction from 3SAT. This resolves a conjecture recently stated by Georgakopoulos and Papasoglu. On the other hand, we show that the problem is in XP when parameterised by treewidth and maximum degree by observing that it is `locally checkable'. In the case $r\leq 3$, we prove that it suffices to parameterise by treewidth. We also state some open questions relating to this work.

math.CO↗
arXiv2024

Tiling in some nonpositively curved groups

We prove that acylindrically hyperbolic groups are monotileable. That is, every finite subset of the group is contained in a finite tile. This provides many new examples of monotileable groups, and progress on the question of whether every group is monotileable. In particular, one-relator groups and many Artin groups are monotileable.

math.GR↗
arXiv2022

Deciding if a hyperbolic group splits over a given quasiconvex subgroup

We present an algorithm which decides whether a given quasiconvex residually finite subgroup $H$ of a hyperbolic group $G$ is associated with a splitting. The methods developed also provide algorithms for computing the number of filtered ends $\tilde e(G,H)$ of $H$ in $G$ under certain hypotheses, and give a new straightforward algorithm for computing the number of ends $e(G,H)$ of the Schreier graph of $H$. Our techniques extend those of Barrett via the use of labelled digraphs, the languages of which encode information on the connectivity of $\partial G - \Lambda H$.

math.GR↗
arXiv2020

Quantum speedups of some general-purpose numerical optimisation algorithms

We give quantum speedups of several general-purpose numerical optimisation methods for minimising a function $f:\mathbb{R}^n \to \mathbb{R}$. First, we show that many techniques for global optimisation under a Lipschitz constraint can be accelerated near-quadratically. Second, we show that backtracking line search, an ingredient in quasi-Newton optimisation algorithms, can be accelerated up to quadratically. Third, we show that a component of the Nelder-Mead algorithm can be accelerated by up to a multiplicative factor of $O(\sqrt{n})$. Fourth, we show that a quantum gradient computation algorithm of Gilyén et al. can be used to approximately compute gradients in the framework of stochastic gradient descent. In each case, our results are based on applying existing quantum algorithms to accelerate specific components of the classical algorithms, rather than developing new quantum techniques.

quant-ph↗