Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Path lifting properties and embedding between RAAGs (1507.06859v2)

Published 24 Jul 2015 in math.GT

Abstract: For a finite simplicial graph $\Gamma$, let $G(\Gamma)$ denote the right-angled Artin group on the complement graph of $\Gamma$. In this article, we introduce the notions of "induced path lifting property" and "semi-induced path lifting property" for immersions between graphs, and obtain graph theoretical criteria for the embedability between right-angled Artin groups. We recover the result of S.-h.{} Kim and T.{} Koberda that an arbitrary $G(\Gamma)$ admits a quasi-isometric group embedding into $G(T)$ for some finite tree $T$. The upper bound on the number of vertices of $T$ is improved from $2{2{(m-1)2}}$ to $m2{m-1}$, where $m$ is the number of vertices of $\Gamma$. We also show that the upper bound on the number of vertices of $T$ is at least $2{m/4}$. Lastly, we show that $G(C_m)$ embeds in $G(P_n)$ for $n\geqslant 2m-2$, where $C_m$ and $P_n$ denote the cycle and path graphs on $m$ and $n$ vertices, respectively.

Summary

We haven't generated a summary for this paper yet.