Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T04:58:48.995Z Has data issue: false hasContentIssue false

Semi-Affine Coxeter-Dynkin Graphs and $G\,\subseteq \,\text{S}{{\text{U}}_{2}}(C)$

Published online by Cambridge University Press:  20 November 2018

John McKay*
Affiliation:
Concordia University, Montréal, Québec, H3G 1M8
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The semi-affine Coxeter-Dynkin graph is introduced, generalizing both the affine and the finite types.

Keywords

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1999

References

[FM] Ford, D. and McKay, J., Representations and Coxeter Graphs. In: The Geometric Vein, Springer-Verlag, New York-Heidelberg-Berlin, 1982, 549554.Google Scholar
[K] Kostant, B., The McKay correspondence, the Coxeter element, and representation theory. In: The mathematical heritage of Élie Cartan, Astérisque, 1985, 209255.Google Scholar
[M1] McKay, J., Graphs, singularities and finite groups. The Santa Cruz Conference on Finite Groups (1979), Proc. Sympos. Pure Math. 37(1980), 183186.Google Scholar
[M2] McKay, J., Cartan matrices, finite groups of quaternions, and Kleinian singularities. Proc. Amer.Math. Soc. 81(1981), 153154.Google Scholar
[JHS] Smith, John H., Some properties of the spectrum of a graph. Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., 1969), Gordon and Breach, New York, 1970, 403406.Google Scholar
[NJAS] Sloane, N. J. A., Error-correcting codes and invariant theory: new applications of a nineteenth century technique. Amer. Math.Monthly 84(1977), 82107.Google Scholar