#8418: Reduced Rauzy graph
--------------------------------------------------------+-------------------
Reporter: jleroy | Owner: jleroy
Type: enhancement | Status:
needs_review
Priority: major | Milestone:
sage-4.3.4
Component: combinatorics | Keywords:
Author: Julien Leroy | Upstream: N/A
Reviewer: Sébastien Labbé, Alexandre Blondin Massé | Merged:
Work_issues: |
--------------------------------------------------------+-------------------
Comment(by jleroy):
Hello Alex.
The answer that you got is correct. In the Rauzy graph of order 'n',
vertices are factors of length 'n' and edges are factors of length 'n+1'.
In your case, the unique vertex corresponds to the empty word and the
letters 'a' and 'b' are the only words of length 1 in the word 'aba'. This
corresponds exactly to the definition of Rauzy graph and in this case, the
reduced Rauzy graph is the same. Actually, it will be the case for any
word if you take n=0.
I could change this INPUT but anyone using the reduced Rauzy graph knows
the definition of Rauzy graph and it is clear in this one that 'n'
represents the length of the factors. Therefore it is clear that n is non
negative. What do you thing about?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8418#comment:9>
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.
