#20154: train-tracks
-------------------------------------------------+-------------------------
Reporter: dbenielli | Owner:
Type: task | Status: new
Priority: major | Milestone: sage-7.1
Component: combinatorics | Resolution:
Keywords: free-group automorphism | Merged in:
Authors: Dominique Benielli and | Reviewers:
Thierry Coulbois | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by mmarco):
Sage's FreeGroup implementation is mostly a wrapper around GAP's. I think
we should keep that since it is the basis for FinitelyPresentedGroups, and
BraidGroup's which are also wrapped around GAP.
Elements of a FreeGroup are represented internally as a Tietze list, so it
should be easy to translate from that representation to the one based in
words and back (as long as the names of the generators is kept clear). So,
instead of rewriting the implementation, I would vote for implementing
that translation (which could be interesting in itself), and use that to
call your code.
--
Ticket URL: <http://trac.sagemath.org/ticket/20154#comment:14>
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.
