Classification of linkage systems

preprint2014arXivOpen access

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 γ∇γ^{\nabla}, similar to Dynkin labels. The linkage diagrams connected under the action of the group WS∨W^{\vee}_{S} constitute the the linkage system L(Γ)\mathscr{L}(Γ). For any simply-laced Carter diagram, the system L(Γ)\mathscr{L}(Γ) is constructed. To obtain linkage diagrams θ∇θ^{\nabla}, we use an easily verifiable criterion: BΓ∨(θ∇)<2\mathscr{B}^{\vee}_Γ(θ^{\nabla}) < 2, where BΓ∨\mathscr{B}^{\vee}_Γ is the inverse quadratic form associated with ΓΓ. A Dynkin diagram Γ′Γ' such that rank(Γ′Γ') = rank(ΓΓ) + 1 and any ΓΓ-associated root subset SS lies in Φ(Γ′)\varPhi(Γ'), is said to be the Dynkin extension. The linkage system L(Γ)\mathscr{L}(Γ) is the union of ΓiΓ_i-components LΓi(Γ)\mathscr{L}_{Γ_i}(Γ) taken for all Dynkin extensions of Γ<DΓiΓ<_D Γ_i. The subset Φ(S)\varPhi(S) of roots of Φ(Γ′)\varPhi(Γ'), linearly dependent on roots of SS is said to be a partial root system. The size of LΓ′(Γ)\mathscr{L}_{Γ'}(Γ) is estimated as follows: ∣LΓ′(Γ)∣≤∣Φ(Γ′)∣−∣Φ(S)∣|\mathscr{L}_{Γ'}(Γ)| \leq |\varPhi(Γ')| - |\varPhi(S)|. Carter diagrams ElE_l and El(ai)E_l(a_i) (resp. DlD_l and Dl(ak)D_l(a_k)) are said to be covalent. For any pair {Γ,Γ~Γ, \widetildeΓ} of covalent Carter diagrams, where ΓΓ is the Dynkin diagram, we explicitly construct the invertible linear map M:P⟶RM : \mathcal{P} \longrightarrow \mathcal{R}, where R\mathcal{R} (resp. P\mathcal{P}) is the root system (resp. partial root system) corresponding to ΓΓ (resp. Γ~\widetildeΓ). In particular, we have ∣L(Γ~)∣=∣L(Γ)∣|\mathscr{L}(\widetildeΓ)| = |\mathscr{L}(Γ)|.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.