The action of the Weyl group on the E8 root system

Abstract

Let be the graph on the roots of the E8 root system, where any two distinct vertices e and f are connected by an edge with color equal to the inner product of e and f. For any set c of colors, let c be the subgraph of consisting of all the 240 vertices, and all the edges whose color lies in c. We consider cliques, i.e., complete subgraphs, of that are either monochromatic, or of size at most 3, or a maximal clique in c for some color set c, or whose vertices are the vertices of a face of the E8 root polytope. We prove that, apart from two exceptions, two such cliques are conjugate under the automorphism group of if and only if they are isomorphic as colored graphs. Moreover, for an isomorphism f from one such clique K to another, we give necessary and sufficient conditions for f to extend to an automorphism of , in terms of the restrictions of f to certain special subgraphs of K of size at most 7.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…