#19159: Check if a word is a Christoffel word.
-------------------------------------+-------------------------------------
Reporter: mlapointe | Owner: mlapointe
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: words, | Merged in:
Christoffel, days69 | Reviewers:
Authors: Mélodie Lapointe | Work issues:
Report Upstream: N/A | Commit:
Branch: | 75724dcc12135aea1ed61d87eada760c70533e81
u/mlapointe/check_if_a_word_is_a_christoffel_word_| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by nadialafreniere):
The description is wrong : "Equivalently, `w` is a Christoffel word iff
`w` is a symmetric
non-empty word and `w[1:n-2]` is a palindrome". It should be `w[1:n-1]` as
in the algorithm.
--
Ticket URL: <http://trac.sagemath.org/ticket/19159#comment:13>
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.
