The Geometry of Cycles in the Cayley Diagram of a Group

We suggest a new approach to the study of relatively hyperbolic groups based on relative isoperimetric inequalities. Various geometric, algebraic, and algorithmic properties are discussed.

In this paper we consider a large family of graphs of hierarchically hyperbolic groups (HHG) and show that their fundamental groups admit HHG structures. To do that, we will investigate the notion of hierarchical quasi convexity and show that for a hyperbolic HHS it coincides with the notion of quasi-convexity. The main technical result, for which we expect further applications, is that it is possible to incorporate the HHG structure of a hierarchically hyperbolically embedde...

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator set rather than just by individual generators. The proposed constructions correspondingly yield finite groups and groupoids whose Cayley graphs satisfy much stronger acyclicity conditions than large girth. We thus obtain generic and canoni...

In this paper we study the word problem of groups corresponding to tessellations of the hyperbolic plane. In particular using the Fibonacci technology developed by the second author we show that groups corresponding to the pentagrid or the heptagrid are not automatic.

We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and non-elementary and H has infinite index in G then the simple random walk on Y is transient.

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs which occur are odd cycles and complete graphs. In this article we present a series of theoretical results which contribute to a computer search verifying this conjecture for all groups of size up to 1024. The conjecture is also verified theoretically for several in...

A group G is acylindrically hyperbolic if it admits a non-elementary acylindrical action on a hyperbolic space. We prove that every acylindrically hyperbolic group G has a generating set X such that the corresponding Cayley graph is a (non-elementary) quasi-tree and the action of G on the Cayley graph is acylindrical. Our proof utilizes the notions of hyperbolically embedded subgroups and projection complexes. As a by-product, we obtain some new results about hyperbolically e...

We survey the relationship between the combinatorics and geometry of graphs and the algebraic structure of right-angled Artin groups. We concentrate on the defining graph of the right-angled Artin group and on the extension graph associated to the right-angled Artin group. Additionally, we discuss connections to geometric group theory and complexity theory. The final version of this survey will appear in "In the tradition of Thurston, vol.~II", ed.~K.~Ohshika and A.~Papadopou...

We characterise hyperbolic groups in terms of quasigeodesics in the Cayley graph forming regular languages. We also obtain a quantitative characterisation of hyperbolicity of geodesic metric spaces by the non-existence of certain local (3,0)-quasigeodesic loops. As an application we make progress towards a question of Shapiro regarding groups admitting a uniquely geodesic Cayley graph.

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if $C$ is a perfect code in some Cayley graph of $G$. In this paper we give sufficient and necessary conditions for a subgroup $H$ of a finite group $G$ to be a perfect code of $G$. Based on this, we determine the finite groups that have no n...