Computation in Coxeter groups II. Constructing minimal roots

DOI10.1090/S1088-4165-07-00319-6zbMath1166.20029arXivmath/0209020MaRDI QIDQ3614514

William Casselman

Publication date: 9 March 2009

Published in: Representation Theory of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0209020

zbMATH Keywords

algorithmsrootsCoxeter groupsreflectionsproducts

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (3)

Automata, reduced words and Garside shadows in Coxeter groups. ⋮ ON PAIRED ROOT SYSTEMS OF COXETER GROUPS ⋮ NONORTHOGONAL GEOMETRIC REALIZATIONS OF COXETER GROUPS

Cites Work

• Unnamed Item
• The set of dominance-minimal roots
• A finiteness property and an automatic structure for Coxeter groups
• Computation in Coxeter groups. I: Multiplication

This page was built for publication: Computation in Coxeter groups II. Constructing minimal roots