McKay trees

From MaRDI portal
Publication:6042824

DOI10.5802/ALCO.270zbMATH Open1512.20019arXiv2109.01842OpenAlexW4368405267MaRDI QIDQ6042824FDOQ6042824


Authors: Avraham Aizenbud, Inna Entova Aizenbud Edit this on Wikidata


Publication date: 4 May 2023

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Given a finite group G and its representation ho, the corresponding McKay graph is a graph Gamma(G,ho) whose vertices are the irreducible representations of G; the number of edges between two vertices pi,au of Gamma(G,ho) is dimHomG(piotimesho,au). The collection of all McKay graphs for a given group G encodes, in a sense, its character table. Such graphs were also used by McKay to provide a bijection between the finite subgroups of SU(2) and the affine Dynkin diagrams of types A,D,E, the bijection given by considering the appropriate McKay graphs. In this paper, we classify all (undirected) trees which are McKay graphs of finite groups and describe the corresponding pairs (G,ho); this classification turns out to be very concise. Moreover, we give a partial classification of McKay graphs which are forests, and construct some non-trivial examples of such forests.


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




Recommendations




Cites Work


Cited In (2)





This page was built for publication: McKay trees

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