DocumentCode
1593890
Title
On Computing Mesh Root Systems and the Isotropy Group for Simply-laced Dynkin Diagrams
Author
Felisiak, Mariusz ; Simson, Daniel
Author_Institution
Fac. of Math. & Comput. Sci., Nicolaus Copernicus Univ., Torun, Poland
fYear
2012
Firstpage
91
Lastpage
97
Abstract
We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Γ(RΔ, ΦA) of roots of Δ in the sense of [20], and matrix morsifications A ∈ MorΔ, for simply-laced Dynkin diagrams Δ ∈ {An, Dn, E6, E7, E8}. One of the main aims of the talk is to present a progress obtained during the last year in solving the problems stated in our talk [6]. We show that the reduced mesh root systems and mesh geometries of roots for each of the Dynkin diagrams Δ can be classified for n ≤ 9 by applying symbolic computer algebra computations and numeric algorithmic computations. We also compute the isotropy group Gl(n, Z)Δ of Δ defined in [22]-[23], determine its structure and compute the Gl(n, Z)Δ-orbits of the morsifications A ∈ MorΔ, for Δ ∈ {An, Dm}, with n ≤ 9 and 4 ≤ m ≤ 8. Results of our computing experiences are presented in three tables of Section 4.
Keywords
geometry; group theory; matrix algebra; process algebra; symbol manipulation; coxeter spectral study; isotropy group; matrix morsifications; mesh geometries; mesh root systems; numeric algorithmic computations; reduced mesh root systems; simply-laced Dynkin diagrams; symbolic computer algebra computations; Algebra; Computers; Geometry; Polynomials; Symmetric matrices; Zinc; C++; Coxeter polynomial; Dynkin diagram; Maple; Weyl group; isotropy group; mesh geometries of roots;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4673-5026-6
Type
conf
DOI
10.1109/SYNASC.2012.16
Filename
6481016
Link To Document