Root systems

  • Richard Kane
  • Jonathan Borwein
  • Peter Borwein
Part of the CMS Books in Mathematics book series (CMSBM)

Abstract

A root system is a reformulation, in terms of linear algebra, of the concept of a finite Euclidean reflection group. More exactly, it is a translation into linear algebra of the geometric configuration formed by the reflecting hyperplanes associated with a reflection group. This reformulation is extremely important. The use of linear algebra enables us to analyze finite reflection groups with great efficiency. All of Chapters 2, 3, 4 and 6 will be devoted to the justification of this remark.

Keywords

Root System Irreducible Representation Linear Algebra Weyl Group Permutation Group 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Richard Kane
    • 1
  • Jonathan Borwein
    • 2
  • Peter Borwein
    • 2
  1. 1.Department of MathematicsUniversity of Western OntarioLondonCanada
  2. 2.Centre for Experimental and Constructive Mathematics, Department of Mathematics and StatisticsSimon Fraser UniversityBurnabyCanada

Personalised recommendations