Related papers: Thick groups have trivial Floyd boundary

We prove that the topological complexity of a finite index subgroup of a hyperbolic group is linear in its index. This follows from a more general result relating the size of the quotient of a free cocompact action of hyperbolic group on a…

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…

In this paper we create many examples of hyperbolic groups with subgroups satisfying interesting finiteness properties. We give the first examples of subgroups of hyperbolic groups which are of type $FP_2$ but not finitely presented. We…

We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is "admitting exponentially many…

Given a surface, the fine $k$-curve graph of the surface is a graph whose vertices are simple closed essential curves and whose edges connect curves that intersect in at most $k$ points. We note that the fine $k$-curve graph is hyperbolic…

We construct nontrivial homomorphisms from the quasi group of some cubic surfaces over $\bbF_{\!p}$ into a group. We show experimentally that the homomorphisms constructed are the only possible ones and that there are no nontrivial…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

We characterize those 1-ended word hyperbolic groups whose Gromov boundaries are homeomorphic to trees of graphs (i.e. to inverse limits of graphs that have particularly simple finitary descriptions). These are groups with the simplest…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

We prove that every locally finite, quasi-transitive graph with a thick end whose cycle space is generated by cycles of bounded length contains the full-grid as an asymptotic minor and as a diverging minor. This in particular includes all…

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

Given a complex of groups over a finite simplicial complex in the sense of Haefliger, we give conditions under which it is possible to build an EZ-structure in the sense of Farrell-Lafont for its fundamental group out of such structures for…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.