#18119: New methods for WordMorhism
-----------------------------+-----------------------------------
Reporter: sstarosta | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: combinatorics | Keywords: sd66
Merged in: | Authors: Štěpán Starosta
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-----------------------------------
Add the following methods to the WordMorphism class
`is_injective()` - injectivity test
`_is_unboundedly_repetive()` - return whether the morphism is unboundedly
repetitive (= has a periodic periodic point containing an unbounded
letter)
`is_pushy()` - return whether if it the morphism is pushy
--
Ticket URL: <http://trac.sagemath.org/ticket/18119>
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.
