A Method of Classifying Simple Laced Root Systems

2008/06/12 by G.R. Vijayakumar, Vijayakumar, G. R.
Computer Science · Engineering · Mathematics · #05C50 #15A18 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.0806.2057

openalex publication_date 2008/06/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A root system in which all roots have same norm is known as a simply laced root system. We present a simple method of classifying all simply laced root systems.

Related

• On simply-laced generalized root systems
• Root systems and hyperkahler varieties
• Strings in abstract root systems
• Classification of the root systems R(m)
• A classification of subsystems of a root system