Classification of linkage systems
Rafael Stekolshchik

TL;DR
This paper introduces a classification framework for linkage systems derived from Carter diagrams, utilizing linkage label vectors, quadratic forms, and Dynkin extensions to analyze root systems and their covalent diagram pairs.
Contribution
It develops a systematic method to classify linkage diagrams and systems, including criteria for linkage diagram construction and explicit mappings between covalent Carter diagrams.
Findings
Constructed linkage systems for simply-laced Carter diagrams.
Established bounds on the size of linkage systems.
Explicitly mapped covalent Carter diagram pairs and their linkage systems.
Abstract
A linkage diagram is obtained from the Carter diagram by adding an extra root , so that the resulting subset of roots is linearly independent. With every linkage diagram we associate the linkage label vector , similar to Dynkin labels. The linkage diagrams connected under the action of the group constitute the the linkage system . For any simply-laced Carter diagram, the system is constructed. To obtain linkage diagrams , we use an easily verifiable criterion: , where is the inverse quadratic form associated with . A Dynkin diagram such that rank() = rank() + 1 and any -associated root subset lies in , is said to be the Dynkin extension.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Topics in Algebra
