#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 abmasse):
There is maybe a last remark I have... Sorry if I'm being over-meticulous.
While I was looking at the INPUT block, I noticed that "integer" was not a
precise enough explanation of the parameter `n`.
Then I tried it on the word `aba` with `n = 0` and it yielded a graph of
one vertex and two edges having labels `word: a` and `word: b`. Is that
what we want ?
Anyway, the last thing that needs to be done would be to be more precise
about `n`. Is it a positive integer (we don't want `0`) or a non negative
integer (we want `0`) ? Moreover, we need to specify what `n` means. It is
the order of the reduced rauzy graph, i.e. the length of the considered
factors.
Julien, if you want to make the changes, make sure you create another
patch that applies on top of Sébastien's.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8418#comment:8>
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.
