Related papers: An obstruction to embedding right-angled Artin gro…

We prove that, aside from the obvious exceptions, the mapping class group of a compact orientable surface is not abstractly commensurable with any right-angled Artin group. Our argument applies to various subgroups of the mapping class…

We compute the relative divergence and the subgroup distortion of Bestvina-Brady subgroups. We also show that for each integer $n\geq 3$, there is a free subgroup of rank $n$ of some right-angled Artin group whose inclusion is not a…

Using abelian coverings of Salvetti complexes, embeddings of outer automorphism groups of right-angled Artin groups (RAAGs) into outer automorphism groups of their particular characteristic subgroups are constructed. Virtual embeddings of…

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…

We prove that if two transvection-free right-angled Artin groups are measure equivalent, then they have isomorphic extension graphs. As a consequence, two right-angled Artin groups with finite outer automorphism groups are measure…

We show that for loopless $6$-regular triangulations on the torus the gap between the choice number and chromatic number is at most $2$. We also show that the largest gap for graphs embeddable in an orientable surface of genus $g$ is of the…

Given a multigraph, suppose that each vertex is given a local assignment of $k$ colours to its incident edges. We are interested in whether there is a choice of one local colour per vertex such that no edge has both of its local colours…

Let $\Gamma$ be a finite connected graph. The (unlabelled) configuration space $UC^n \Gamma$ of $n$ points on $\Gamma$ is the space of $n$-element subsets of $\Gamma$. The $n$-strand braid group of $\Gamma$, denoted $B_n\Gamma$, is the…

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 construct several families of embeddings of braid groups into mapping class groups of orientable and non-orientable surfaces and prove that they induce the trivial map in stable homology in the orientable case, but not so in the…

Given a right-angled Artin group $G$ with finite outer automorphism group, we determine which right-angled Artin groups are measure equivalent (or orbit equivalent) to $G$.

We develop a theory of curve diagrams for Artin groups of type B. We define the winding number labeling and the wall crossing labeling of curve diagrams, and show that these labelings detect the classical and the dual Garside length,…

We study commutation properties of subsets of right-angled Artin groups and trace monoids. We show that if Gamma is any graph not containing a four-cycle without chords, then the group G(Gamma) does not contain four elements whose…

The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic component has size at most $C$. We show that…

It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…

We show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all…

A set of colored graphs are compatible, if for every color $i$, the number of vertices of color $i$ is the same in every graph. A simultaneous embedding of $k$ compatibly colored graphs, each with $n$ vertices, consists of $k$ planar…

We define the intersection complex for the universal cover of a compact weakly special square complex and show that it is a quasi-isometry invariant. By using this quasi-isometry invariant, we study the quasi-isometric classification of…

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…

We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…