Related papers: Embedability between right-angled Artin groups

For a graph $\Gamma$, let $K(H_{\Gamma},1)$ denote the Eilenberg-Mac Lane space associated to the right-angled Artin (RAA) group $H_{\Gamma}$ defined by $\Gamma$. We use the relationship between the combinatorics of $\Gamma$ and the…

We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\cal C$ of graphs that…

Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this work, we consider the problem of bijectively embedding the…

Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…

We show that a right-angled Artin group, defined by a graph $\Gamma$ that has at least three vertices, does not split over an infinite cyclic subgroup if and only if $\Gamma$ is biconnected. Further, we compute JSJ--decompositions of…

Let $G$ be a subgroup of ${\rm PGL}_2({\mathbb F}_q)$, where $q$ is any prime power, and let $Q \in {\mathbb F}_q[x]$ such that ${\mathbb F}_q(x)/{\mathbb F}_q(Q(x))$ is a Galois extension with group $G$. By explicitly computing the Artin…

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

Right-angled Artin groups and their subgroups are of great interest because of their geometric, combinatorial and algorithmic properties. It is convenient to define these groups using finite simplicial graphs. The isomorphism type of the…

In this paper we study the classification of right-angled Artin groups up to commensurability. We characterise the commensurability classes of RAAGs defined by trees of diameter 4. In particular, we prove a conjecture of Behrstock and…

This paper focuses on tools for constructing 4-manifolds that have fundamental group $G$ isomorphic to a right-angled Artin group and that are also minimal, in the sense that they minimize $b_2(M)$, the dimension of $H_2(M;\mathbb{Q})$. For…

Consider the mapping class group $\Mod_{g,p}$ of a surface $\Sigma_{g,p}$ of genus $g$ with $p$ punctures, and a finite collection $\{f_1,...,f_k\}$ of mapping classes, each of which is either a Dehn twist about a simple closed curve or a…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

Artin's representation is an injective homomorphism from the braid group $B_n$ on $n$ strands into $\operatorname{Aut}\mathbb{F}_n$, the automorphism group of the free group $\mathbb{F}_n$ on $n$ generators. The representation induces maps…

We say that a graph $F$ can be embedded into a graph $G$ if $G$ contains an isomorphic copy of $F$ as a subgraph. Guo and Volkmann \cite{GV} conjectured that if $G$ is a connected graph with at least $n$ vertices and minimum degree at least…

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

We determine exactly which graph products, also known as Right Angled Artin Groups, embed into Richard Thompson's group $V$. It was shown by Bleak and Salazar-Diaz that $\mathbb{Z}^2 * \mathbb{Z}$ was an obstruction. We show that this is…

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

Recently, right-angled Artin groups have attracted much attention in geometric group theory. They have a rich structure of subgroups and nice algorithmic properties, and they give rise to cubical complexes with a variety of applications.…

We develop an analogy between right-angled Artin groups and mapping class groups through the geometry of their actions on the extension graph and the curve graph respectively. The central result in this paper is the fact that each…

We address the induced matching enumeration problem. An edge set $M$ is an induced matching of a graph $G =(V,E)$. The enumeration of matchings are widely studied in literature, but the induced matching has not been paid much attention. A…