Related papers: Uniquely labelled geodesics of Coxeter groups
We classify two-dimensional right-angled Coxeter groups that are quasiisometric to a right-angled Artin group defined by a tree, and show that when this is true the right-angled Coxeter group actually contains a visible finite index…
The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…
We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…
We analyze the interplay between labeled trees and the ultrametric spaces they present. We provide characterizations of labeled trees that generate separable ultrametric spaces and those that generate locally finite ultrametric spaces. In…
We introduce a new quasi-isometry invariant of 2-dimensional right-angled Coxeter groups, the hypergraph index, that partitions these groups into infinitely many quasi-isometry classes, each containing infinitely many groups. Furthermore,…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
We introduce the notion of halfspaces associated to a group splitting, and investigate the relationship between the coarse geometry of the halfspaces and the coarse geometry of the group. Roughly speaking, the halfspaces of a group…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
Results are obtained concerning the roots of asymmetric geometric representations of Coxeter groups. These representations were independently introduced by Vinberg and Eriksson, and generalize the standard geometric representation of a…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two…
The unipotent subgroup of a finite group of Lie type over a prime field Z/pZ comes equipped with a natural set of generators; the properties of the Cayley graph associated to this set of generators have been much studied. In the present…
It is shown that a locally finite ultrametric space $(X, d)$ is generated by labeled tree if and only if, for every open ball $B \subseteq X$, there is a point $c \in B$ such that $d(x, c) = \operatorname{diam} B$ whenever $x \in B$ and $x…
We consider the class of those Coxeter groups for which removing from the Cayley graph any tubular neighbourhood of any wall leaves exactly two connected components. We call these Coxeter groups bipolar. They include both the virtually…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.
The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of…
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…
In this paper we study ends of finitely generated semigroups. The ends we are working with are the ends of the undirected graphs of Cayley graphs of finitely generated semigroups. We prove that the number of ends is preserved for…
A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…