Orthogonal systems in finite graphs
From MaRDI portal
Publication:2454487
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.
Recommendations
Cited in
(9)- Automorphisms of partially commutative groups. I: Linear subgroups.
- Automorphisms of groups and a higher rank JSJ decomposition. I: RAAGs and a higher rank Makanin-Razborov diagram
- Combinatorially orthogonal matrices and related graphs
- Structure of the automorphism group for partially commutative class two nilpotent groups.
- Orthogonal structures in directed graphs
- Universal theories for partially commutative metabelian groups.
- scientific article; zbMATH DE number 3846801 (Why is no real title available?)
- Parabolic and quasiparabolic subgroups of free partially commutative groups.
- Partially commutative metabelian groups: centralizers and elementary equivalence.
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)