A colourful classification of (quasi) root systems and hyperplane arrangements

Abstract

We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as restrictions of root (sub)systems on such intersections, generalising the regular part of a Cartan subalgebra. We also consider a slight variation to encode the hyperplane arrangements only, showing there is a unique noncrystallographic arrangement that arises. Finally, a variation of the main definition leads to elementary classifications of closed and Levi root subsystems.

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…