RightAngled Artin Groups¶
A rightangled Artin group (often abbreviated as RAAG) is a group which has a presentation whose only relations are commutators between generators. These are also known as graph groups, since they are (uniquely) encoded by (simple) graphs, or partially commutative groups.
AUTHORS:
 Travis Scrimshaw (20130901): Initial version
 Travis Scrimshaw (20180205): Made compatible with
ArtinGroup

class
sage.groups.raag.
RightAngledArtinGroup
(G, names)¶ Bases:
sage.groups.artin.ArtinGroup
The rightangled Artin group defined by a graph \(G\).
Let \(\Gamma = \{V(\Gamma), E(\Gamma)\}\) be a simple graph. A rightangled Artin group (commonly abbreviated as RAAG) is the group
\[A_{\Gamma} = \langle g_v : v \in V(\Gamma) \mid [g_u, g_v] \text{ if } \{u, v\} \notin E(\Gamma) \rangle.\]These are sometimes known as graph groups or partially commutative groups. This RAAG’s contains both free groups, given by the complete graphs, and free abelian groups, given by disjoint vertices.
Warning
This is the opposite convention of some papers.
Rightangled Artin groups contain many remarkable properties and have a very rich structure despite their simple presentation. Here are some known facts:
 The word problem is solvable.
 They are known to be rigid; that is for any finite simple graphs \(\Delta\) and \(\Gamma\), we have \(A_{\Delta} \cong A_{\Gamma}\) if and only if \(\Delta \cong \Gamma\) [Dro1987].
 They embed as a finite index subgroup of a rightangled Coxeter group (which is the same definition as above except with the additional relations \(g_v^2 = 1\) for all \(v \in V(\Gamma)\)).
 In [BB1997], it was shown they contain subgroups that satisfy the property \(FP_2\) but are not finitely presented by considering the kernel of \(\phi : A_{\Gamma} \to \ZZ\) by \(g_v \mapsto 1\) (i.e. words of exponent sum 0).
 \(A_{\Gamma}\) has a finite \(K(\pi, 1)\) space.
 \(A_{\Gamma}\) acts freely and cocompactly on a finite dimensional \(CAT(0)\) space, and so it is biautomatic.
 Given an Artin group \(B\) with generators \(s_i\), then any subgroup generated by a collection of \(v_i = s_i^{k_i}\) where \(k_i \geq 2\) is a RAAG where \([v_i, v_j] = 1\) if and only if \([s_i, s_j] = 1\) [CP2001].
The normal forms for RAAG’s in Sage are those described in [VW1994] and gathers commuting groups together.
INPUT:
G
– a graphnames
– a string or a list of generator names
EXAMPLES:
sage: Gamma = Graph(4) sage: G = RightAngledArtinGroup(Gamma) sage: a,b,c,d = G.gens() sage: a*c*d^4*a^3*b v0^2*v1*v2*v3^4 sage: Gamma = graphs.CompleteGraph(4) sage: G = RightAngledArtinGroup(Gamma) sage: a,b,c,d = G.gens() sage: a*c*d^4*a^3*b v0*v2*v3^4*v0^3*v1 sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G Rightangled Artin group of Cycle graph sage: a,b,c,d,e = G.gens() sage: d*b*a*d v1*v3^2*v0 sage: e^1*c*b*e*b^1*c^4 v2^3
We create the previous example but with different variable names:
sage: G.<a,b,c,d,e> = RightAngledArtinGroup(Gamma) sage: G Rightangled Artin group of Cycle graph sage: d*b*a*d b*d^2*a sage: e^1*c*b*e*b^1*c^4 c^3
REFERENCES:
 [Cha2006]
 [BB1997]
 [Dro1987]
 [CP2001]
 [VW1994]
 Wikipedia article Artin_group#Rightangled_Artin_groups

class
Element
(parent, lst)¶ Bases:
sage.groups.artin.ArtinGroupElement
An element of a rightangled Artin group (RAAG).
Elements of RAAGs are modeled as lists of pairs
[i, p]
wherei
is the index of a vertex in the defining graph (with some fixed order of the vertices) andp
is the power.

gen
(i)¶ Return the
i
th generator ofself
.EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.gen(2) v2

gens
()¶ Return the generators of
self
.EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.gens() (v0, v1, v2, v3, v4) sage: Gamma = Graph([('x', 'y'), ('y', 'zeta')]) sage: G = RightAngledArtinGroup(Gamma) sage: G.gens() (vx, vy, vzeta)

graph
()¶ Return the defining graph of
self
.EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.graph() Cycle graph: Graph on 5 vertices

ngens
()¶ Return the number of generators of
self
.EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.ngens() 5

one
()¶ Return the identity element \(1\).
EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.one() 1

one_element
()¶ Return the identity element \(1\).
EXAMPLES:
sage: Gamma = graphs.CycleGraph(5) sage: G = RightAngledArtinGroup(Gamma) sage: G.one() 1