#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 | def701588736edda81a86ddd1a9cbdbc849657be
Dependencies: #20107 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by stumpc5):
Travis: Also, you introduced {{{_reduced_word}}} to be a lazy attribute.
This has a few drawbacks: {{{not self._reduced_word is None}}} in the
length function in {{{reflection_group_real.py}}} is never triggered, and
{{{_reduced_word}}} is now either a word in the index set (if the lazy
attribute is triggered in the real case), or a word in {{{range(n)}}} if
one has gotten it through the iterator. This way, the method
{{{reduced_word}}} in the real case is always executed, even though the
reduced word is already known.
Two solutions are:
* either set {{{_reduced_word}}} to a word in the indices in the iterator
for the cost of list lookups for each letter in the word
* write the lazy attribute in the real case so that it gives a word in
{{{range(n)}}}
* do neither and forget about the info gotten from the iterator in the
real case.
--
Ticket URL: <http://trac.sagemath.org/ticket/11187#comment:211>
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.
