Voir la notice de l'article provenant de la source Numdam
Given a finite group and its representation , the corresponding McKay graph is a graph whose vertices are the irreducible representations of ; the number of edges between two vertices of is . The collection of all McKay graphs for a given group encodes, in a sense, its character table. Such graphs were also used by McKay to provide a bijection between the finite subgroups of and the affine Dynkin diagrams of types , 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 ; 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.
Aizenbud, Avraham 1 ; Entova-Aizenbud, Inna 2
@article{ALCO_2023__6_2_513_0, author = {Aizenbud, Avraham and Entova-Aizenbud, Inna}, title = {McKay trees}, journal = {Algebraic Combinatorics}, pages = {513--531}, publisher = {The Combinatorics Consortium}, volume = {6}, number = {2}, year = {2023}, doi = {10.5802/alco.270}, language = {en}, url = {http://geodesic.mathdoc.fr/articles/10.5802/alco.270/} }
TY - JOUR AU - Aizenbud, Avraham AU - Entova-Aizenbud, Inna TI - McKay trees JO - Algebraic Combinatorics PY - 2023 SP - 513 EP - 531 VL - 6 IS - 2 PB - The Combinatorics Consortium UR - http://geodesic.mathdoc.fr/articles/10.5802/alco.270/ DO - 10.5802/alco.270 LA - en ID - ALCO_2023__6_2_513_0 ER -
Aizenbud, Avraham; Entova-Aizenbud, Inna. McKay trees. Algebraic Combinatorics, Tome 6 (2023) no. 2, pp. 513-531. doi: 10.5802/alco.270
Cité par Sources :