2001/06/14 by Terry Gannon, Gannon, Terry
Computer Science · Mathematics · Physics and Astronomy · #Advanced Algebra and Logic #Algebraic structures and combinatorial models #Commutative Algebra and Its Applications #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #hep-th
paper · pdf · doi:10.48550/arxiv.hep-th/0106123
20 pages
openalex publication_date 2001/06/14 · arxiv created 2002/02/12 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Weyl groups are ubiquitous, and efficient algorithms for them -- especially for the exceptional algebras -- are clearly desirable. In this paper we provide several of these, addressing practical concerns arising naturally for instance in computational aspects of the study of affine algebras or Wess-Zumino-Witten conformal field theories. We also discuss the efficiency and numerical accuracy of these algorithms.