Orthogonal systems in finite graphs

From MaRDI portal
Publication:2454487

zbMATH Open1299.05155arXiv0707.0087MaRDI QIDQ2454487FDOQ2454487


Authors: Andrew Duncan, Ilya Kazachkov, Vladimir Remeslennikov Edit this on Wikidata


Publication date: 13 June 2014

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0707.0087




Recommendations





Cited In (9)





This page was built for publication: Orthogonal systems in finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454487)