2000 character limit reached
Embedding problem between right-angled Artin groups (2304.05267v1)
Published 11 Apr 2023 in math.GR, math.CO, and math.MG
Abstract: Given a graph $\Gamma$, the right-angled Artin group $A(\Gamma)$ is given by the presentation $\langle u \in V(\Gamma) \mid [u,v]=1, \ {u,v} \in E(\Gamma) \rangle$. The Embedding Problem in right-angled Artin groups asks, given two finite graphs $\Phi,\Psi$, how to determine whether or not $A(\Phi)$ is isomorphic to a subgroup of $A(\Psi)$. These are the notes of a mini-course given at the CIRM in April 2022, dedicated to a geometric point of view on this embedding problem, based on quasi-median graphs.