We show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6.
Published in:
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on
Date of Conference: 26-29 Sept. 2011