#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: |
-------------------------------------+-------------------------------------
Comment (by tscrim):
I've created #16320 to make it easier to access elements in an infinite
list (but I have not merged it in so it's not a dependency). I'm not sure
if at the end of the day we want to keep using
`DisjointUnionEnumeratedSets` and possibly adding better general support
for those or making our own special subclasses and having them be better
targeted for the roots here. Nicolas, do you have any thoughts/comments on
this?
IMO this can be left for a follow-up ticket unless there is a simple and
clear better solution. Although if #16320 is a good way to go, I'll merge
that in and update the doctests accordingly.
--
Ticket URL: <http://trac.sagemath.org/ticket/15384#comment:20>
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.
