Related papers: Quasiisometric embeddings between right-angled Art…

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

The architecture of infinite structures with non-crystallographic symmetries can be modeled via aperiodic tilings, but a systematic construction method for finite structures with non-crystallographic symmetry at different radial levels is…

We study the algebraic structure of the automorphism group of a general right-angled Artin group. We show that this group is virtually torsion-free and has finite virtual cohomological dimension. This generalizes results proved by the…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

We give a geometric characterisation of those groups that arise as fixed subgroups of finite-order untwisted automorphisms of right-angled Artin groups (RAAGs). They are precisely the fundamental groups of a class of compact special cube…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodromic elements are generic (i.e. they have full density with respect to counting in balls for…

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

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…

We show that in any right-angled Artin group whose defining graph has chromatic number $k$, every non-trivial element has stable commutator length at least $1/(6k)$. Secondly, if the defining graph does not contain triangles, then every…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

For a finite simplicial graph $\Gamma$, let $A(\Gamma)$ denote the right-angled Artin group on $\Gamma$. Recently Kim and Koberda introduced the extension graph $\Gamma^e$ for $\Gamma$, and established the Extension Graph Theorem: for…

In 1995, Rips and Sela asked if torsionfree hyperbolic groups admit globally stable cylinders. We establish this property for all residually finite hyperbolic groups and curve graphs of finite-type surfaces. These cylinders are fine…

In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…

Let G be a group which is hyperbolic relative to a collection of subgroups A, and it is also hyperbolic relative to a collection of subgroups B. Suppose that the collection A contains B. We characterize, for subgroups of G, when…

The existence of a primitive element of $GF(q)$ with certain properties is used to prove that all cycles that could theoretically be embedded in $AG(2,q)$ and $PG(2,q)$ can, in fact, be embedded there (i.e. these planes are `pancyclic'). We…

For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…

We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…

A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…