-
-
Notifications
You must be signed in to change notification settings - Fork 527
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
is_primitive of WordMorphism is broken #8095
Comments
This comment has been minimized.
This comment has been minimized.
comment:2
I just posted a patch which solves the described problem. The solution uses the following algorithm:
Are we sure this is true? Is there a proof of that somewhere? |
Attachment: trac_8095_wordmorph_is_primitive-sl.patch.gz tested on sage-4.3.1 |
comment:4
I found a reference for the above statement (Automatic sequences of Allouche and Shallit). |
Author: slabbe |
comment:5
Tested on sage-4.3.1 as well and it works. |
Reviewer: abmasse |
Changed reviewer from abmasse to Alexandre Blondin Massé |
Changed author from slabbe to Sébastien Labbé |
Merged: sage-4.3.2.alpha1 |
Let us define the following morphism over 3 letters:
Then we get
but also
expected behaviour:
See the description of ".is_primitive()":
Returns True if self is primitive.
A morphism ϕ is primitive if there exists an positive integer k such
that for all α∈Σ, ϕk(α) contains all the letters of Σ.
So, if a morphism is primitive, so are all its powers. And if there is
a power which is primitive, so is the morphism itself. In the example
above, both outputs should be "True".
This was reported here (via 'Report a problem'):
http://groups.google.com/group/sage-combinat-devel/browse_thread/thread/5ed1186c229e7343?hl=en
CC: @sagetrac-abmasse
Component: combinatorics
Author: Sébastien Labbé
Reviewer: Alexandre Blondin Massé
Merged: sage-4.3.2.alpha1
Issue created by migration from https://trac.sagemath.org/ticket/8095
The text was updated successfully, but these errors were encountered: