ALGEBRAIC COMBINATORICS

no. 2
McKay trees
Aizenbud, Avraham1; Entova-Aizenbud, Inna2
1 Department of Mathematics, Weizmann Institute of Science, Rehovot, Israel
2 Department of Mathematics, Ben Gurion University of the Negev, Beer-Sheva, Israel
Algebraic Combinatorics, Volume 6 (2023) no. 2, pp. 513-531.

Given a finite group G and its representation ρ, the corresponding McKay graph is a graph Γ(G,ρ) whose vertices are the irreducible representations of G; the number of edges between two vertices π,τ of Γ(G,ρ) is dimHom G (π⊗ρ,τ). 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,ρ); 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.

Received:
Accepted:
Published online:
DOI: 10.5802/alco.270
Classification: 20C15
Keywords: Representation theory, groups, McKay graphs
Aizenbud, Avraham 1; Entova-Aizenbud, Inna 2

1 Department of Mathematics, Weizmann Institute of Science, Rehovot, Israel
2 Department of Mathematics, Ben Gurion University of the Negev, Beer-Sheva, Israel
License: CC-BY 4.0
Copyrights: The authors retain unrestricted copyrights and publishing rights 
@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 = {https://alco.centre-mersenne.org/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  - https://alco.centre-mersenne.org/articles/10.5802/alco.270/
DO  - 10.5802/alco.270
LA  - en
ID  - ALCO_2023__6_2_513_0
ER  - 
%0 Journal Article
%A Aizenbud, Avraham
%A Entova-Aizenbud, Inna
%T McKay trees
%J Algebraic Combinatorics
%D 2023
%P 513-531
%V 6
%N 2
%I The Combinatorics Consortium
%U https://alco.centre-mersenne.org/articles/10.5802/alco.270/
%R 10.5802/alco.270
%G en
%F ALCO_2023__6_2_513_0
Aizenbud, Avraham; Entova-Aizenbud, Inna. McKay trees. Algebraic Combinatorics, Volume 6 (2023) no. 2, pp. 513-531. doi : 10.5802/alco.270. https://alco.centre-mersenne.org/articles/10.5802/alco.270/

[1] Aschbacher, M. Finite group theory, Cambridge Studies in Advanced Mathematics, 10, Cambridge University Press, Cambridge, 2000, xii+304 pages | DOI | MR

[2] Browne, Hazel Connectivity properties of McKay quivers, Bull. Aust. Math. Soc., Volume 103 (2021) no. 2, pp. 182-194 | DOI | MR | Zbl

[3] Diaconis, Persi Threads through group theory, Character theory of finite groups (Contemp. Math.), Volume 524, Amer. Math. Soc., Providence, RI, 2010, pp. 33-47 | DOI | MR | Zbl

[4] McKay, John Graphs, singularities, and finite groups, The Santa Cruz Conference on Finite Groups (Univ. California, Santa Cruz, Calif., 1979) (Proc. Sympos. Pure Math.), Volume 37, Amer. Math. Soc., Providence, R.I., 1980, pp. 183-186 | DOI | MR | Zbl

[5] Smith, John H. Some properties of the spectrum of a graph, Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), Gordon and Breach, New York (1970), pp. 403-406 | MR | Zbl

[6] Steinberg, Robert Finite subgroups of SU 2 , Dynkin diagrams and affine Coxeter elements, Pacific J. Math., Volume 118 (1985) no. 2, pp. 587-598 | DOI | MR | Zbl

Cited by Sources: