Abstract
The computer algebra system CHEVIE is designed to facilitate computations with various combinatorial structures arising in Lie theory, like finite Coxeter groups and Hecke algebras. We discuss some recent examples where CHEVIE has been helpful in the theory of algebraic groups, in questions related to unipotent classes, the Springer correspondence and Lusztig families.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
