Orthogonal Systems in Finite Graphs
Group Theory
2007-07-03 v1
Abstract
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially commutative groups (or right-angled Artin groups). In this paper we construct orthogonality theory for graphs with the study of partially commutative groups in mind. The theory developed here provides tools for the study of the structure of the centraliser lattice of partially commutative groups and for their automorphism groups.
Cite
@article{arxiv.0707.0087,
title = {Orthogonal Systems in Finite Graphs},
author = {Andrew J Duncan and Ilya V Kazachkov and Vladimir N Remeslennikov},
journal= {arXiv preprint arXiv:0707.0087},
year = {2007}
}
Comments
38 pages, 6 figures