A computer program for obtaining subsystems.

MaRDI QIDQ2716021zbMATH OpenFDO

Authors Himmet Can, Lee Hawkins

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

Dynkin diagramsMapleprogramsreal crystallographic root systemssubsystems

Mathematics Subject Classification ID

Simple, semisimple, reductive (super)algebras (17B20) Representation theory for linear algebraic groups (20G05) Symbolic computation and algebraic computation (68W30)

Review text

The article presents a computer program, written in the symbolic computation system Maple, that determines for the input real crystallographic root system all subsystems. Working of the algorithm is illustrated on several examples. The authors plan to extend the algorithm to complex root systems.

Recommendations

• Closed subsets of root systems and regular subalgebras
• A new approach to the construction of subsystems of complex root systems.
• scientific article; zbMATH DE number 3871627
• scientific article; zbMATH DE number 2130672
• scientific article; zbMATH DE number 3893374

Cited in

(2)

• Closed subsets of root systems and regular subalgebras
• A new approach to the construction of subsystems of complex root systems.

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A computer program for obtaining subsystems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716021)