#15384: Improvements to root systems
-------------------------------------+-------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.3
Component: combinatorics | Resolution:
Keywords: root systems, | Merged in:
days54 | Reviewers: Dan Bump
Authors: Travis Scrimshaw | Work issues:
Report Upstream: N/A | Commit:
Branch: | 18fd0946874e2e54a75cdcd761311dea3f2810a4
public/combinat/root_systems/improvements-15384| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Description changed by tscrim:
Old 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.
New 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 A,,2n,,^(2)^ would give A,,2n,,).
- (Dual) Coxeter numbers for finite types.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/15384#comment:18>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
