Related papers: Graphically discrete groups and rigidity

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

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…

We consider expansive group actions on a compact metric space containing a special fixed point denoted by $0$, and endomorphisms of such systems whose forward trajectories are attracted toward $0$. Such endomorphisms are called…

We construct torsion-free hyperbolic groups without unique product whose subgroups up to some given finite index are themselves non-unique product groups. This is achieved by generalising a construction of Comerford to graphical small…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that,…

In this article we prove that the set of torsion-free groups acting by isometries on a hyperbolic metric space whose entropy is bounded above and with a compact quotient is finite. The number of such groups can be estimated in terms of the…

For real hyperbolic spaces, the dynamics of individual isometries and the geometry of the limit set of nonelementary discrete isometry groups have been studied in great detail. Most of the results were generalised to discrete isometry…

We prove that a finitely generated group contains a sequence of non-trivial elements which converge to the identity in every compact homomorphic image if and only if the group is not virtually abelian.

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

A graphical design is a proper subset of vertices of a graph on which many eigenfunctions of the Laplacian operator have mean value zero. In this paper, we show that extremal independent sets make extremal graphical designs, that is, a…

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…

We give a short geometric proof of a result of Soardi & Woess and Salvatori that a quasitransitive graph is amenable if and only if its automorphism group is amenable and unimodular. We also strengthen one direction of that result by…

For a torsion free finitely generated nilpotent group G we naturally associate four finite dimensional nilpotent Lie algebras over a field of characteristic zero. We show that if G is a relatively free group of some variery of nilpotent…

In this article we prove some previously announced results about metric ultraproducts of finite simple groups. We show that any non-discrete metric ultraproduct of alternating or special linear groups is a geodesic metric space. For more…

We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…

We define the notion of rough Cayley graph for compactly generated locally compact groups in terms of quasi-actions. We construct such a graph for any compactly generated locally compact group using quasi-lattices and show uniqueness up to…

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

We study algebraic properties on a group G such that if the discrete group G has these properties then every locally compact shift continuous topology on G with adjoined zero is either compact, or discrete. We introduce electorally flexible…