Commuting graphs on Coxeter groups, Dynkin diagrams and finite subgroups of SL(2,\mathbb{C})

MaRDI QIDQ6284019zbMATH OpenFDO

Authors Umar Hayat, Álvaro Nolla de Celis, Fawad Ali

Publication date 7 March 2017

Abstract: For a group $H$ and a non empty subset $GammasubseteqH$, the commuting graph $G=mathcalC(H,Gamma)$ is the graph with $Gamma$ as the node set and where any $x,yinGamma$ are joined by an edge if $x$ and $y$ commute in $H$. We prove that any simple graph can be obtained as a commuting graph of a Coxeter group, solving the realizability problem in this setup. In particular we can recover every Dynkin diagram of ADE type as a commuting graph. Thanks to the relation between the ADE classification and finite subgroups of $SL(2,C)$, we are able to rephrase results from the {em McKay correspondence} in terms of generators of the corresponding Coxeter groups. We finish the paper studying commuting graphs $mathcalC(H,Gamma)$ for every finite subgroup $HsubsetSL(2,C)$ for different subsets $GammasubseteqH$, and investigating metric properties of them when $Gamma=H$.

This page was built for publication: Commuting graphs on Coxeter groups, Dynkin diagrams and finite subgroups of $SL(2,\mathbb{C})$

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