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
Refine growing letters #32594
Comments
Author: Sébastien Labbé |
Commit: |
comment:1
We did this this morning during the Sage Thursday's in Bordeaux. New commits:
|
Branch: u/slabbe/32594 |
comment:2
Tu fais du sage en dehors des sage thursdays maintenant :) |
comment:3
The "(mortal, polynomial, exponential)" would better be inside I don't understand the nested loop. Could you explain in the documentation or in comment how and why it works? |
comment:4
ok |
comment:5
Replying to @videlec:
C'était fait pendant, mais il y a eu une panne d'internet vers 11h45, donc j'ai fait le git push après déjeuner:) |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:9
Added few more comments. Now need review. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:12
And few more sorry. Now I stop. Needs review! |
Changed branch from u/slabbe/32594 to u/vdelecroix/32594 |
New commits:
|
comment:14
I added a commit on top of yours. I did some modifications in the code in order to avoid building many dictionaries. Actually, the whole code is pure linear algebra and could be moved to matrices. |
comment:15
If you are ok you can set to positive review. |
comment:16
There is only one issue to be fixed:
After that fixed, I am fine with positive review. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Reviewer: Vincent Delecroix, Sébastien Labbé |
Changed author from Sébastien Labbé to Sébastien Labbé, Vincent Delecroix |
Changed branch from u/vdelecroix/32594 to |
The aim is to refine
WordMorphism.growing_letters
to differentiate the various possible behaviors of|sigma^n(letter)|
. This growth is always of the formalpha^n n^beta
(wherealpha
is a Perron number andbeta
an integer). Without doing any linear algebra we could differentiatealpha=0
)alpha=1
)alpha > 1
)The output of the method will a 3-tuple of lists
(mortal, polynomial, exponential)
wheremortal
: list of mortal letterspolynomial
: a list of lists wherepolynomial[i]
is the list of letters with growthn^i
.exponential
: list of at least exponentionally growing lettersThe implementation can be done iteratively by "cleaning" the morphism
immortal_letters
to detect mortal letters and remove themCC: @sagetrac-jlepsova @seblabbe
Component: combinatorics
Author: Sébastien Labbé, Vincent Delecroix
Branch/Commit:
ce5ca81
Reviewer: Vincent Delecroix, Sébastien Labbé
Issue created by migration from https://trac.sagemath.org/ticket/32594
The text was updated successfully, but these errors were encountered: