#9877: Add is_sturmian_factor, is_tangent methods for finite words
-----------------------------+----------------------------------------------
Reporter: tmonteil | Owner: tmonteil
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.6.1
Component: combinatorics | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by abmasse):
Hi, Thierry !
Sorry if I haven't been available lately (busy, you know, the usual
justification...).
If I'm not mistaken, there were last minor issues with your ticket that
haven't been completely solved. To recap:
1. Cleaning some commented code.
1. Adding the `len(set(w)) == 2` condition. I understand your point of
view that this should be done by many other functions in Sage, but for
now, it will be cleaner if we do so.
1. Finally, I agree with you about keeping the name
`is_sturmian_factor`.
1. Providing a reference for the theorem that desubstituting as possible
to the empty word is equivalent to being Sturmian.
This is pretty much it!
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9877#comment:11>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
