#11187: Implementation of finite reflection groups
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.2
Component: combinatorics | Resolution:
Keywords: reflection group, | Merged in:
days49, days 64.5 | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: public/11187 | 5a377c42bdcba53fde3504489eab396194bc509f
Dependencies: #20107 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by stumpc5):
> Just FYI - you have reverted a python3 compatible change with this
I am sure there are reasons for that python3 convention, but I do prefer
simple to read code. Anyway, I can also do the other if you prefer.
> How much additional code would it take to make it work on both sides,
I was afraid you'd ask that. in my eyes: too much. The elements are
considered as permutations, words, and matrices at the same time (and
there are even two types of words, in simples and in all reflections, and
the simple words have wired properties in the non-real case), making
options would pollute the code just soo much, I think, and would introduce
so many possible mistakes. I prefer to have clean and fast code, that is
hopefully getting better than chevie, eventually. Once that is achieved, I
am getting in favour with adding another layer of user friendliness.
--
Ticket URL: <http://trac.sagemath.org/ticket/11187#comment:219>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
