Closed
Description
Implement various things for affine root systems:
- The symmetric form
( | )
. - Methods for checking the short/long/imaginary roots.
- Modelling the positive roots roots in affine types.
- Basic untwisted types (so type A2n(2) would give A2n).
- (Dual) Coxeter numbers for finite types.
CC: @sagetrac-sage-combinat @anneschilling @nthiery @darijgr @bsalisbury1 @dwbump
Component: combinatorics
Keywords: root systems, days54
Author: Travis Scrimshaw
Branch/Commit: 7285940
Reviewer: Daniel Bump
Issue created by migration from https://trac.sagemath.org/ticket/15384