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
Fix bug in WordMorphism.growing_letters() and periodic_points() #31454
Comments
comment:3
Thanks for proposing such fixes. I will take a look as soon as possible. |
comment:4
Martin. Your branch should include the two doctests that are in the ticket description. Since the sage doctests are run it will prevent the bug to occur again in the future. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:6
Replying to @videlec:
Done. |
Reviewer: Vincent Delecroix |
comment:7
thanks! |
Changed branch from u/gh-mrejmon/fix_growing_and_periodic to |
should return
False
.This happens due to the
if self.is_primitive(): return True
optimization. Easily fixable for example like this:should return
[[word: bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...]]
.I think this happens because
periodic_points()
doesn't check whether the letters are growing, so the following should fix it (assuming we only care about periodic points with infinite length):I added a branch with the proposed fixes.
CC: @seblabbe @slel
Component: combinatorics
Author: Martin Rejmon
Branch/Commit:
87a8aae
Reviewer: Vincent Delecroix
Issue created by migration from https://trac.sagemath.org/ticket/31454
The text was updated successfully, but these errors were encountered: