By Topic

Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mariusz Felisiak ; Fac. of Math. & Comput. Sci., Nicolaus Copernicus Univ., Torun, Poland ; Daniel Simson

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