#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
Component: combinatorics | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
Comment(by tmonteil):
Replying to [comment:2 abmasse]:
> 1. Could you add a reference where one can find the proof that a word
is finite sturmian if and only if you can desubstitute it to the empy
word?
Sure. This is a well known result (though there are many variants of this
idea, i do not know whether this exact one is written somewhere), but i
will add at least in the Arnoux chapter of the Pytheas Fogg book. I guess
i will also add a reference to a recent article of Smillie and Ulcigrai
which explains this in a nice way.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9877#comment:5>
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.
