Strings in abstract root systems
Abstract
Let be a subset of the simple roots of a (possibly non-reduced) abstract root system , and let λ ∈ . We define the -string of λ as the set of elements in \0\ of the form λ + Σα ∈ nα α, where nα is an integer for each α ∈ . This notion can be regarded as some sort of generalization of the classical notion of α-string, where α ∈ .
0
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.