#18584: Iterator through magma elements
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: combinatorics | Resolution:
Keywords: sagedays64.5 | Merged in:
Authors: Christian Stump | Reviewers:
Report Upstream: N/A | Work issues: document
Branch: | Commit:
u/stumpc5/iterator_through_magma_elements|
154e2ea9207b5bedcb2bf38fe899d139d1159012
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by nthiery):
Hi Christian, Travis!
Replying to [comment:12 tscrim]:
> I believe there is an issue with needing associativity. Specifically, I
don't believe that iterator could get `(a * b) * (a * b)`. However, I
think a default iterator could be described by using all previously
encountered elements.
Indeed this is why I had put this iterator in `Semigroups`.
Which raises a good question: could we implement this with the current
`RecursivelyEnumeratedSet`?
Christian: what's your use case?
Cheers,
--
Ticket URL: <http://trac.sagemath.org/ticket/18584#comment:13>
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.
