The Classification of the Simply Laced Berger Graphs from Calabi-Yau CY3 spaces
Abstract
The algebraic approach to the construction of the reflexive polyhedra that yield Calabi-Yau spaces in three or more complex dimensions with K3 fibres reveals graphs that include and generalize the Dynkin diagrams associated with gauge symmetries. In this work we continue to study the structure of graphs obtained from CY3 reflexive polyhedra. The objective is to describe the ``simply laced'' cases, those graphs obtained from three dimensional spaces with K3 fibers which lead to symmetric matrices. We study both the affine and, derived from them, non-affine cases. We present root and weight structurea for them. We study in particular those graphs leading to generalizations of the exceptional simply laced cases E6,7,8 and E6,7,8(1). We show how these integral matrices can be assigned: they may be obtained by relaxing the restrictions on the individual entries of the generalized Cartan matrices associated with the Dynkin diagrams that characterize Cartan-Lie and affine Kac-Moody algebras. These graphs keep, however, the affine structure present in Kac-Moody Dynkin diagrams. We conjecture that these generalized simply laced graphs and associated link matrices may characterize generalizations of Cartan-Lie and affine Kac-Moody algebras.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.