Related papers: Splittings of right-angled Artin groups

For any right-angled Artin group $A_{\Gamma}$ we construct a finite-dimensional space $\mathcal{O}_{\Gamma}$ on which the group $\text{Out}(A_{\Gamma})$ of outer automorphisms of $A_{\Gamma}$ acts with finite point stabilizers. We prove…

The {\it prime 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 $G$ of order…

The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We establish the tracial stability of a certain class of graph products of C*-algebras. This result involves the development of the "pincushion class" of finite graphs. We then apply this result in two ways. The first application yields a…

We study the set of critical exponents of discrete groups acting on regular trees. We prove that for every real number $\delta$ between $0$ and $\frac{1}{2}\log q$, there is a discrete subgroup $\Gamma$ acting without inversion on a…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

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…

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 find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…

The action dimension of a discrete group $\Gamma$ is the smallest dimension of a contractible manifold which admits a proper action of $\Gamma$. Associated to any flag complex $L$ there is a right-angled Artin group, $A_L$. We compute the…

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…

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

Given a regular covering map $\varphi:\Lambda \to \Gamma$ of graphs, we investigate the subgroup $\operatorname{LAut}(\varphi)$ of the automorphism group $\operatorname{Aut}(A_\Gamma)$ of the right-angled Artin group $A_\Gamma$. This…

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 investigate invariant random subgroups in groups acting on rooted trees. Let $\mathrm{Alt}_f(T)$ be the group of finitary even automorphisms of the $d$-ary rooted tree $T$. We prove that a nontrivial ergodic IRS of $\mathrm{Alt}_f(T)$…

We define a family of groups that include the mapping class group of a genus g surface with one boundary component and the integral symplectic group Sp(2g,Z). We then prove that these groups are finitely generated. These groups, which we…

We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…

We give a condition on the defining graph of a right-angled Artin group which implies its automorphism group is virtually indicable, that is, it has a finite-index subgroup that admits a homomorphism onto $\Z$. We use this as part of a…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…