#11187: Implementation of finite reflection groups
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: reflection group, | Merged in:
days49 | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: | 425ca38c084a51fa56c301153165269031fb5e0d
u/stumpc5/11187-new | Stopgaps:
Dependencies: #8327 #14137 |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
We have discussed already that in order to fix the `Irreducible` axiom, it
is needed (in addition to the nested class) to have a `SubcategoryMethod`
called `Irreducible`.
Note that if we define `WellGeneratedComplexReflectionGroups` as a sub-
category of `ComplexReflectionGroups.Finite()`, we should probably remove
its subcategory-methods `Finite` and `Irreducible`, since both axioms have
already been defined in the super-category.
--
Ticket URL: <http://trac.sagemath.org/ticket/11187#comment:46>
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.
