Related papers: Quasi-isometric classification of graph manifold g…

Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…

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…

For a hierarchically hyperbolic group, we provide sufficient conditions under which suitable powers of a finite collection of elements generate a right-angled Artin subgroup. Under additional hypotheses, we further show that this subgroup…

For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…

This paper overviews recent developments in the classification up to quasi-isometry of finitely generated groups, and more specifically of relatively hyperbolic groups.

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 prove using a novel random matrix model that all right-angled Artin groups have a sequence of finite dimensional unitary representations that strongly converge to the regular representation. We deduce that this result applies also to:…

A quasi-isometry between two connected graphs is measure-scaling if one can control precisely the sizes of pre-images of finite subsets. Such a notion is motivated by the work of Eskin-Fisher-Whyte on lamplighters over $\mathbb{Z}$ and the…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

It is shown that the middle quasi-homomorphisms of Fujiwara and Kapovich are precisely constant perturbations of quasi-homomorphisms. Quasi-polynomial maps are defined and their constructibility is explored. In particular, it is shown that…

We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…

The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

By analyzing known presentations of the pure mapping groups of orientable surfaces of genus $g$ with $b$ boundary components and $n$ punctures, we show that these groups are isomorphic to some groups related to the braid groups and the…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

The present article is concerned with division algebras that are structurally close to alternative algebras, in the sense that they satisfy some identity or other algebraic property that holds for all alternative division algebras.…

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…

Almost-flat manifolds were defined by Gromov as a natural generalisation of flat manifolds and as such share many of their properties. Similarly to flat manifolds, it turns out that the existence of a spin structure on an almost-flat…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…