Poly-free constructions for right-angled Artin groups

Simple item page
dc.creatorHermiller, Susan
dc.creatorSunik, Zoran
dc.date2005-05-31
dc.date.accessioned2026-07-07T05:20:23Z
dc.date.available2026-07-07T05:20:23Z
dc.descriptionWe show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all right-angled Artin groups of poly-free length 2 is given, namely the group AG has poly-free length 2 if and only if there exists an independent set of vertices D in G such that every cycle in G meets D at least twice. Finally, it is shown that AG is a semidirect product of 2 free groups of finite rank if and only if G is a finite tree or a finite complete bipartite graph. All of the proofs of the existence of poly-free structures are constructive.
dc.description21 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0505666
dc.identifierhttp://arxiv.org/abs/math/0505666
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75362
dc.subjectGroup Theory
dc.subject20F36, 20F05
dc.titlePoly-free constructions for right-angled Artin groups
dc.typetext

Files

Collections

arXiv