McKay trees

Combinatorial aspects of representation theory (05E10) Ordinary representations and characters (20C15) Combinatorial aspects of groups and algebras (05E16)

Abstract: Given a finite group

G

and its representation

h o

, the corresponding McKay graph is a graph

G a m m a (G, h o)

whose vertices are the irreducible representations of

G

; the number of edges between two vertices

p i, a u

of

G a m m a (G, h o)

is

d i m H o m_{G} (p i o t i m e s h o, a u)

. 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

S U (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, h o)

; 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.

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)