SearcharxivSearch

arXiv subjects

Joseph Paul MacManus

Publications and source records attributed to Joseph Paul MacManus.

3 recordsLinked to original sources

Vertex-transitive graphs with uniformly bisecting quasi-geodesics

Suppose that $X$ is an infinite, connected, locally finite, quasi-transitive graph with the property that every bi-infinite quasi-geodesic uniformly coarsely separates $X$ into exactly two deep pieces. We show that such an $X$ is quasi-isometric to either the Euclidean plane or the hyperbolic plane. In particular, if $X$ is a Cayley graph of a finitely generated group $G$ with the above property, then $G$ is a virtual surface group. This can be interpreted as an extension of the well-known fact that a hyperbolic group with circular boundary is virtually Fuchsian. Our theorem positively resolves Problem 14.98 of the Kourovka Notebook, posed by V. A. Churkin in 1999. The proof uses an isoperimetric inequality of Coulhon--Saloff-Coste to show that if such a graph has the above property, then either it is hyperbolic or has quadratic growth.

math.GR

Accessibility, planar graphs, and quasi-isometries

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to planar graphs. In particular, such a group is virtually a free product of free and surface groups, and thus virtually admits a planar Cayley graph.

math.GR

Relative accessibility for graphs

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups. This implies, in particular, that relative accessibility is a quasi-isometry invariant amongst finitely generated groups, when the quasi-isometry coarsely preserves the left cosets of the peripheral subgroups. We also deduce a relative variant of Hamann's accessibility theorem on graphs with finitely generated cycle spaces.

math.CO