Opened 7 years ago
Last modified 10 months ago
#20154 needs_work task
traintracks
Reported by:  Dominique Benielli  Owned by:  

Priority:  major  Milestone:  sagewishlist 
Component:  group theory  Keywords:  freegroup automorphism 
Cc:  Travis Scrimshaw, Thierry Monteil, Vincent Delecroix  Merged in:  
Authors:  Dominique Benielli, Thierry Coulbois  Reviewers:  
Report Upstream:  N/A  Work issues:  
Branch:  public/traintrack (Commits, GitHub, GitLab)  Commit:  dcc540c770298bac710358c72e35c9ea3961bcde 
Dependencies:  Stopgaps: 
Description (last modified by )
We propose to implement in Sage the traintracks package developed by Thierry Coulbois:
The main feature and the main achievement of the program is to compute traintrack representative for (outer) automorphisms of free groups. phi.train track() computes a traintrack representative for the (outer) automorphism phi. This traintrack can be either an absolute traintrack or a relative traintrack. The celebrated theorem of Bestvina and Feighn assures that if phi is fully irreducible (iwip), then there exists an absolute traintrack representing phi. The traintrack(relative=False) method will terminate with either an absolute traintrack or with a topological representative with a reduction: an invariant strict subgraph with nontrivial fundamental group. One more feature of traintracks (absolute or relative) is to lower the number of Nielsen paths. Setting the stable=True option will return a traintrack with at most one indivisible Nielsen path (per exponential stratum if it is a relative traintrack).
See also:
 https://github.com/coulbois/sagetraintrack
 https://www.i2m.univamu.fr/perso/thierry.coulbois/traintrack/
 #31223: Add sagetraintrack as an optional package
Change History (112)
comment:1 Changed 7 years ago by
Authors:  → Dominique Benielli and Thierry Coulbois 

Component:  PLEASE CHANGE → combinatorics 
Description:  modified (diff) 
Keywords:  freegroup automorphisme added 
Type:  PLEASE CHANGE → task 
comment:2 Changed 7 years ago by
Cc:  Travis Scrimshaw added 

Description:  modified (diff) 
Keywords:  automorphism added; automorphisme removed 
comment:3 Changed 7 years ago by
Cc:  Thierry Monteil added 

comment:4 followup: 5 Changed 7 years ago by
I could be interested in this. Specially to add it as a functionality for Braid groups.
I have taken a quick look at Coulbois code, and it seems that it was writen before we had free groups in sage (or at least, he writes his own implementation of free groups).
So my impression is that we would need to heavily adapt his code in order to fit our current infrastructure.
If you are ok with it, we can start discussing which should be the right structure to follow.
comment:5 Changed 7 years ago by
Replying to mmarco:
I could be interested in this. Specially to add it as a functionality for Braid groups.
I have taken a quick look at Coulbois code, and it seems that it was writen before we had free groups in sage (or at least, he writes his own implementation of free groups).
So my impression is that we would need to heavily adapt his code in order to fit our current infrastructure.
If you are ok with it, we can start discussing which should be the right structure to follow.
Hi,
Thanks for your comment. We are still working on traintrack adaptation for sage, format code, checked test , that takes more time that I expected were I opened the ticket ... Indeed our main issue is the FreeGroup? implementation (we have already do some change comparing to the traintrack code of Thierry) but we have still a reduced FreeGroup?, and the compatibility with the FreeGroup? is Sage is not easy (same use functionality). We of course ok to start discussing about this issue and we wish to find a light solution. The easiest way would be to rename our FreeGroup? but may be we can make something better. So we are open to any suggestion. Dominique
comment:6 Changed 7 years ago by
Would it be possible to use sage's FreeGroup? (maybe adding to it the functinalities that you need?)
comment:7 followup: 8 Changed 7 years ago by
Let me change the question slightly, what functionality from a free group do you need? (Also, you won't need to rename your free group because it is in a separate module.)
comment:8 followup: 9 Changed 7 years ago by
Hello the Sage community,
I finally got a trac.sagemath account to reply !
Of course we need to use (and adapt) the existing FreeGroup? in Sage.
The main difference is my use of alphabets with inverse letters (AlphabetWithInverses? in my program). There have been some discussions with Vincent Delecroix on my choices. I hope my code is not too poorly written and I can adapt easily.
The point is that my free groups are to be used as domain of WordMorphisms? and as such they should have alphabets (and not only generators)... The elements should be words.
May be we could discuss that by mail with Vincent, Thierry M. and Marco ?
comment:9 Changed 7 years ago by
Replying to coulbois:
May be we could discuss that by mail with Vincent, Thierry M. and Marco ?
I think this thread/ticket is a good place as it allows other interested people to follow and join the discussion (and does not perturb others).
comment:10 Changed 7 years ago by
I also would prefear the discussion to happen here. But if it becomes useful at some point, we could try some kind of live meeting (via google hangouts or other similar means)
I am still trying to understand your code to see how could it fit with the existing sage classes.
comment:11 followup: 12 Changed 7 years ago by
It is also entirely possible we will need to abstract out code from the current FreeGroup
, IndexedFreeGroup
, and your implementation (and from a quick lookover, that is probably what will happen).
comment:12 Changed 7 years ago by
Yes of course we can also adapt the existing FreeGroup? to my code. For that I need to know how much it is used. In particular as it seems to be only a wrapper of GAP.
Apparently there are two different approaches:
1/ The present FreeGroup? (from GAP) focuses on the fact that free groups are algebraic objects (they have generators and the elements are somehow abstract group elements)
2/ Whereas my approach is closer to that of Words: free group are combinatorial objects and their elements are words on an alphabet.
I don't know how much these two approaches are compatible. And how much we can merge or converge to a common approach. The differences are probably similar to that between FreeMonoid? and Words.
Marco can you tell us how much your FreeGroup? is used, how much it is important that its elements are from a GAP wrap class (ElementLibGAP) ?
comment:13 Changed 7 years ago by
I have to run now, but a quick response. IIRC, it is used to construct the free algebra, but I believe you're right in that it is basically a wrapper of GAP. I'd have to doublecheck the latter.
comment:14 Changed 7 years ago by
Sage's FreeGroup? implementation is mostly a wrapper around GAP's. I think we should keep that since it is the basis for FinitelyPresentedGroups?, and BraidGroup?'s which are also wrapped around GAP.
Elements of a FreeGroup? are represented internally as a Tietze list, so it should be easy to translate from that representation to the one based in words and back (as long as the names of the generators is kept clear). So, instead of rewriting the implementation, I would vote for implementing that translation (which could be interesting in itself), and use that to call your code.
comment:15 Changed 7 years ago by
By the way, I got an error when trying to test your code:
sage: from all import *  ImportError Traceback (most recent call last) <ipythoninput19796be731807> in <module>() > 1 from all import * /home/mmarco/sagetraintrack/all.py in <module>() > 1 from free_group import FreeGroup 2 from free_group_automorphism import FreeGroupMorphism, FreeGroupAutomorphism, free_group_automorphisms 3 from inverse_alphabet import AlphabetWithInverses /home/mmarco/sagetraintrack/free_group.py in <module>() 13 from sage.combinat.words.words import FiniteWords_over_OrderedAlphabet as FiniteWords 14 > 15 from inverse_alphabet import AlphabetWithInverses, AbstractAlphabetWithInverses 16 from free_group_word import FreeGroupWord 17 ImportError: cannot import name AbstractAlphabetWithInverses
comment:16 Changed 7 years ago by
Branch:  → u/dbenielli/train_tracks 

comment:17 Changed 7 years ago by
Commit:  → 8e7f6300f59a3eca9d69233a52fc09b025cb33a2 

comment:18 Changed 7 years ago by
Yes, all tests passed
sage: from sage.combinat.words.all import * sage: AlphabetWithInverses?(2) Alphabet with inverses on ['a', 'b']
comment:19 Changed 7 years ago by
This is in response to http://ask.sagemath.org/question/33238/unabletobuildthedocreferencehtml/. There are a lot of problems with the formatting of the docstrings. Here are a few fixes as illustrations. See also http://www.sphinxdoc.org/en/stable/rest.html and http://docutils.sourceforge.net/rst.html for the basics of reStructuredText, and http://doc.sagemath.org/html/en/developer/coding_basics.html#documentationstrings for Sagespecific instructions.

src/sage/combinat/words/convex_core.py
diff git a/src/sage/combinat/words/convex_core.py b/src/sage/combinat/words/convex_core.py index 0183e0f..a3c873a 100644
a b AUTHORS: 6 6 7 7  Thierry COULBOIS (20130101) : initial version 8 8  Dominique BENIELLI (201602_15) : 9 AMU University <dominique.benielli@univamu.fr>,10 Integration in SageMath9 AMU University <dominique.benielli@univamu.fr>, 10 Integration in SageMath 11 11 12 12 EXAMPLES:: 13 13 … … class ConvexCore(): 46 46 Guirardel's convex core of two simplicial 47 47 trees with an action of a free group. 48 48 49 Let T1 and T2 be trees with actions of the free group FN. G1=T1/FN50 and G2=T2/FNare MarkedGraph.49 Let `T_1` and `T_`2` be trees with actions of the free group `FN`. `G_1=T_1/FN` 50 and `G_2=T_2/FN` are MarkedGraph. 51 51 52 52 A ConvexCore is a CWcomplex of dimension 2. 2cells are 53 53 squares. 1cells are edges labeled by edges of G1 or G2. A square 54 54 is of the form 55 55 56 :: 57 56 58 e 57 59 > 58 60   … … class ConvexCore(): 89 91 90 92 EXAMPLES:: 91 93 92 sage: phi=FreeGroupAutomorphism("a>ab,b>ac,c>a")93 sage: phi=phi*phi94 sage: C=ConvexCore(phi)95 sage: print C.slice('c',0)96 Looped multidigraph on 2 vertices94 sage: phi=FreeGroupAutomorphism("a>ab,b>ac,c>a") 95 sage: phi=phi*phi 96 sage: C=ConvexCore(phi) 97 sage: print C.slice('c',0) 98 Looped multidigraph on 2 vertices 97 99 98 sage: C.vertices()99 [0, 1, 2, 3]100 sage: C.vertices() 101 [0, 1, 2, 3] 100 102 101 sage: C.squares()102 [[3, 0, 2, 1, 'c', 'a']]103 sage: C.squares() 104 [[3, 0, 2, 1, 'c', 'a']] 103 105 104 sage: C.twice_light_squares()105 [[1, 4, 0, 5, 'a', 'c']]106 sage: C.twice_light_squares() 107 [[1, 4, 0, 5, 'a', 'c']] 106 108 107 109 AUTHORS: 108 110 … … class ConvexCore(): 686 688  a homotopy equivalence 687 689 688 690  that maps the root v0 of ``G0.spanning_tree()`` to the root v1 of 689 ``G1.spanning_tree()``691 ``G1.spanning_tree()`` 690 692 691 693  the image of each vertex has at least two gates. 692 694 … … class ConvexCore(): 771 773 772 774 773 775  The boundary of a square is a list [e0,e1,e2,e3] of edges such that 774 e0=(w,v,(a,0)) and e2 are edges with a positive letter775 a, and e1=(w,v,(b,1)) and e3 are edges with b a776 positive letter.776 e0=(w,v,(a,0)) and e2 are edges with a positive letter 777 a, and e1=(w,v,(b,1)) and e3 are edges with b a 778 positive letter. 777 779 778 780  The boundary of an edge it is the list [v0,v1] of the initial vertex 779 v0=(w,v) followed by the terminal vertex.781 v0=(w,v) followed by the terminal vertex. 780 782 781 783 Whereas for lists: 782 784 783 785  squares: ``[v0,v1,v2,v3,a,b]`` where v0,v1,v2 and v3 are 784 786 integers standing for vertices and a,b are positive letters 785 labeling edges of G0 and G1: 787 labeling edges of G0 and G1:: 786 788 787 789 a 788 v3 > v2789 ^ ^790  791 b b792  793  a 794 v0 >v1790 v3 > v2 791 ^ ^ 792   793 b b 794   795  a  796 v0 >v1 795 797 796 798  edges: ``[v0,v1,(a,side)]`` where ``v0`` and ``v1`` are 797 799 integers standing for vertices a is a label of the tree on … … class ConvexCore(): 799 801 800 802 INPUT: 801 803 802  ``cell``square, an edge or a vertex. Squares are bounded803 by four vertices, edges by two vertices.804  ``cell`` square, an edge or a vertex. Squares are bounded 805 by four vertices, edges by two vertices. 804 806 805 807 OUTPUT: 806 808 The boundary of a cell is the list of vertices bounding it. 807 809 808 810 EXAMPLES:: 809 811 810 sage: phi = FreeGroupAutomorphism("a>ab,b>ac,c>a")**2811 sage: C = ConvexCore(phi)812 sage: C.boundary((Word('C'), 0, 'c', 'a')) # boundary of a square813 [(word: C, 0, ('c', 0)),814 (word: , 0, ('a', 1)),815 (word: Bc, 0, ('C', 0)),816 (word: B, 0, ('A', 1))]812 sage: phi = FreeGroupAutomorphism("a>ab,b>ac,c>a")**2 813 sage: C = ConvexCore(phi) 814 sage: C.boundary((Word('C'), 0, 'c', 'a')) # boundary of a square 815 [(word: C, 0, ('c', 0)), 816 (word: , 0, ('a', 1)), 817 (word: Bc, 0, ('C', 0)), 818 (word: B, 0, ('A', 1))] 817 819 818 sage: C.boundary([3, 0, 2, 1, 'c', 'a']) # boundary of a square819 [[3, 0, ('c', 0)], [0, 2, ('a', 1)], [2, 1, ('C', 0)], [1, 3, ('A', 1)]]820 sage: C.boundary([3, 0, 2, 1, 'c', 'a']) # boundary of a square 821 [[3, 0, ('c', 0)], [0, 2, ('a', 1)], [2, 1, ('C', 0)], [1, 3, ('A', 1)]] 820 822 821 sage: C.boundary((Word('Bc'),0,('C',0))) # boundary of an edge822 [(word: Bc, 0), (word: B, 0)]823 sage: C.boundary((Word('Bc'),0,('C',0))) # boundary of an edge 824 [(word: Bc, 0), (word: B, 0)] 823 825 824 sage: C.boundary([2,1,'C']) # boundary of an edge825 [2, 1]826 sage: C.boundary([2,1,'C']) # boundary of an edge 827 [2, 1] 826 828 """ 827 829 828 830 if isinstance(cell, tuple):
comment:20 followup: 23 Changed 7 years ago by
Building documentation fails. And I get many doctest failing:
sage t warnlong 47.3 src/sage/combinat/words/test_train_track.py # 5 doctests failed sage t warnlong 47.3 src/sage/misc/sagedoc.py # 4 doctests failed sage t warnlong 47.3 src/sage/categories/groups.py # 2 doctests failed sage t warnlong 47.3 src/sage/categories/magmas.py # 13 doctests failed sage t warnlong 47.3 src/sage/modules/vector_double_dense.pyx # 1 doctest failed sage t warnlong 47.3 src/sage/modules/with_basis/representation.py # 2 doctests failed sage t warnlong 47.3 src/sage/groups/braid.py # 27 doctests failed sage t warnlong 47.3 src/sage/groups/libgap_wrapper.pyx # 76 doctests failed sage t warnlong 47.3 src/sage/groups/finitely_presented.py # 241 doctests failed sage t warnlong 47.3 src/sage/groups/group.pyx # 2 doctests failed sage t warnlong 47.3 src/sage/groups/free_group.py # 123 doctests failed sage t warnlong 47.3 src/sage/groups/libgap_group.py # 11 doctests failed sage t warnlong 47.3 src/sage/groups/generic.py # 3 doctests failed
I don't think it is a good idea to override the default FreeGorup? implementation. Many parts of Sage deppend on it. It would make more sense to extend it with the methods that are needed for the rest of your code.
comment:21 Changed 7 years ago by
Authors:  Dominique Benielli and Thierry Coulbois → Dominique Benielli, Thierry Coulbois 

comment:23 Changed 7 years ago by
Yes, I begin to understand, that I will need to use (and add functionalities) to the current FreeGroup?.
The main difficulty is that I rely heavily on WordMorphism?, in particular for parsing:
FreeGroupAutomorphism?("a>ab,b>aC,c>a")
And for applying or compose morphisms. These are heavily used in my program.
This suggest that I would like that my elements of FreeGroup? are Word. Do you have any objection to FreeGroup? also inheriting from Words ? And FreeGroupElement? from Word ?
I guess that it is not too complicated to add Words and Word methods to your FreeGroup? and FreeGroupElement?. But will that interfere with deeper GAP implementations (I am completly new to GAP)?
Would that be satisfactory to Sage gurus that FreeGroup? are both an algebraic object and a symbolic one ?
Finally there is also a IndexedFreeGroup? class which is not a wrapper of GAP, how does it fit in this discussion ?
I don't think it is a good idea to override the default FreeGorup? implementation. Many parts of Sage deppend on it. It would make more sense to extend it with the methods that are needed for the rest of your code.
comment:24 followup: 25 Changed 7 years ago by
I guess it makes sense to consider FreeGroupElements? as Words, but we should be careful to make sure that the multiple inheritance doesn't break anything. We should also probably rewrite the different constructors.
In any case, we need a class for morphisms of free groups (or more general, finitely presented groups), so it might be a good opportunity to design that infrastructure.
comment:25 Changed 7 years ago by
Replying to mmarco:
In any case, we need a class for morphisms of free groups (or more general, finitely presented groups), so it might be a good opportunity to design that infrastructure.
This is my opinion as well. Parsing of the input is an API decision and, IMO, not a good reason to use a specific implementation. Unless you are using other features of WordMorphism
that are not (currently) available to the current group morphisms or I am misunderstanding comment:23.
Actually, I am somewhat not in favor of using words because of the need to handle inverses in the free group. There should not really be that much of an implementation difference between the free group using words or GAP, just an API difference...at least I'd imagine there shouldn't be...
comment:26 Changed 7 years ago by
Commit:  8e7f6300f59a3eca9d69233a52fc09b025cb33a2 → 2fbe7c6745dc59fc60b8ccb1c616224b3c60a5b3 

Branch pushed to git repo; I updated commit sha1. New commits:
2fbe7c6  improvment for doc build

comment:27 followup: 29 Changed 7 years ago by
Dominique finished to setup the test and to cleanup the doc. Let's say that we have a clean version 1. I am refering to the master branch of my https://github.com/coulbois/sagetraintrack repository.
1/ Please try and explore this version for functionnalities. Do you find all what you need for free group automorphisms and traintracks ?
2/ Now, we need to make that compatible with the FreeGroup? of sage.groups. I propose to start from the file sage.groups.free_group.py and add the methods I need. This is the purpose of the work branch in my https://github.com/coulbois/sagetraintrack repository. I fear that this implies givingup the fact that free groups elements are words. Everybody is okay with that ?
(I guess I am not in the correct Sage workflow, please comment if you have a better one).
comment:28 Changed 7 years ago by
I still haven't taken a detailed looked yet (sorry), but this does look very impressive. I am looking forward to getting this project and code included into Sage.
I think it would be good for you to list here exactly what functionality you're missing from free groups in Sage (and their morphisms) and/or to create a separate ticket, which would become a dependency of this ticket, that would implement these features.
Although, you are not really loosing the interpretation of free group elements as words because you have the Tietze()
, but it will likely require some changes to the implementations. (Sorry for a bit of repetition, but IMO, a finite word is much more naturally associated with a free monoid because of the concatenation does not involve cancellation.) The biggest possible obstruction to this that I see currently is that you are using some feature only implemented for word morphisms.
Math question, does the theory of traintracks extend to free groups on (countably) infinite generators?
comment:29 Changed 7 years ago by
2/ Now, we need to make that compatible with the FreeGroup? of sage.groups. I propose to start from the file sage.groups.free_group.py and add the methods I need. This is the purpose of the work branch in my https://github.com/coulbois/sagetraintrack repository. I fear that this implies givingup the fact that free groups elements are words. Everybody is okay with that ?
I am certainly okay with that. From a quick look at your code, it sounds very natural to rewrite it on top of existing FreeGroups? (for instance, you needed to add some way to concatenate word with cancelations, whereas in the framework of freegroups you have all that for free as the standard product).
(I guess I am not in the correct Sage workflow, please comment if you have a better one).
In theory, we should handle the branches in this server instead of github. But given the size of the project, and the fact that we are in a stage where we are pretty much experimenting before deciding the actual dessign, it may be ok to handle this early branches somewhere else (as long is everybody is ok about working through github). Although at some point we should move it all to trac branches.
comment:30 Changed 7 years ago by
Hi all,
As Thierry says previously we decided to make the compatibilyty with the sage FreeGroup? through the hard way, used it and add functionnalities. Three or more module need to be rewrited, when we obtain a first draft version I am pushing in in the sage ticket. So there no need for you to worry about a external branche.
Dominique
comment:31 Changed 7 years ago by
Commit:  2fbe7c6745dc59fc60b8ccb1c616224b3c60a5b3 → 3ecdcdfe553c1f97769d69f659977e1b6eebaabb 

Branch pushed to git repo; I updated commit sha1. New commits:
3ecdcdf  rm fille

comment:32 followup: 34 Changed 7 years ago by
Advice/approval needed
I started using and modifying the existing FreeGroup?. I refer to the work branch of my git repo (not the sage one)
1/ My guess is that I can rely mainly on the Tietze() method of FreeGroupElement?. I have no idea of the GAP implementation of FreeGroupElement?.
2/ I extended init() methods to allow more API (accepting strings for example). I added getitem and comparisons methods. Now FreeGroupElement? behave loosely as words and I expect to rely on them.
3/ I started to adapt the FreeGroupMorphism?. I am not really willing to write a GroupMorphism? (even an abstract one) class as I have no idea of what Group and GroupElement? look like. I propose to use a _morph variable to store a dictionnary that map FreeGroupElement? (the generators and their inverses) to FreeGroupElement? (once again I have no idea of the cost, may be a dictionnary from integers to integer list together with Tietze() would be more efficient though less natural).
The doc is not yet uptodate.
I am currently working further. But please stop me if you believe my choices are stupid.
comment:33 Changed 7 years ago by
Commit:  3ecdcdfe553c1f97769d69f659977e1b6eebaabb → efa12d37913aadd10e7c8cb59e9068aae64e6ff7 

Branch pushed to git repo; I updated commit sha1. New commits:
efa12d3  remove all

comment:34 Changed 7 years ago by
Replying to coulbois:
1/ My guess is that I can rely mainly on the Tietze() method of FreeGroupElement?. I have no idea of the GAP implementation of FreeGroupElement?.
This is the way to go because Tietze()
pull info from its GAP data. This should also be reasonably fast.
2/ I extended init() methods to allow more API (accepting strings for example). I added getitem and comparisons methods. Now FreeGroupElement? behave loosely as words and I expect to rely on them.
I am okay with the __getitem__
. There is a default total order from the generic GAP element implementation, which the total order may or may not be good, but it is likely one of the faster ways to check for (in)equality. However, I haven't looked at your current code yet.
3/ I started to adapt the FreeGroupMorphism?. I am not really willing to write a GroupMorphism? (even an abstract one) class as I have no idea of what Group and GroupElement? look like. I propose to use a _morph variable to store a dictionnary that map FreeGroupElement? (the generators and their inverses) to FreeGroupElement? (once again I have no idea of the cost, may be a dictionnary from integers to integer list together with Tietze() would be more efficient though less natural).
No matter what, I think you would need a FreeGroupMorphism
class for everything that you want to do. I think the internal storage method should depend on the application, but the user input should be a tuple, which is consistent with the rest of Sage and requires less validation of the input.
You will probably want to create a FreeGroupHomset
(which you will need to add a _hom_
method to FreeGroup
to create this), whose elements are your FreeGroupMorphism
, which can be constructed directly from the hom
method. By having the morphism take a tuple as input, you shouldn't have to modify the hom
method.
A question: does your framework handle morphisms to free groups with different generator labels? If not, would it be easy to support this (and do you want to)? If also no, then don't worry about it.
comment:35 Changed 6 years ago by
Branch:  u/dbenielli/train_tracks → public/train_track 

Commit:  efa12d37913aadd10e7c8cb59e9068aae64e6ff7 
comment:36 Changed 6 years ago by
Component:  combinatorics → group theory 

Milestone:  sage7.1 → sage7.3 
comment:37 Changed 6 years ago by
Branch:  public/train_track → public/traintrack 

Cc:  Vincent Delecroix added 
Commit:  → 9f9d12bb0ec6a7d5c49b1f5bbff95b0e5f28b1b8 
comment:38 Changed 6 years ago by
(I fixed the name of the branch, it was traintrack
and not train_track
)
comment:39 Changed 6 years ago by
For python3 compatibility:
 please do not use the
it.next
method, but insteadnext(it)
 please do not write
print (something)
but ratherprint(something)
(no space after print)
see my patchbot's report for more information
comment:40 Changed 6 years ago by
Commit:  9f9d12bb0ec6a7d5c49b1f5bbff95b0e5f28b1b8 → 020d0a2b4739c15815da5209044bac01ce4661db 

Branch pushed to git repo; I updated commit sha1. New commits:
020d0a2  python3 compatibility

comment:41 Changed 6 years ago by
ok  use the it.next method, but instead next(it) ok  print(something)
in commit 020d0a2 python3 compatibility
comment:42 Changed 6 years ago by
Commit:  020d0a2b4739c15815da5209044bac01ce4661db → 737c4e51196298e5bffbc3a79ca5a0311fd83f34 

Branch pushed to git repo; I updated commit sha1. New commits:
737c4e5  doc

comment:43 Changed 6 years ago by
there remains two lines with oldstyle python2 print (in the doctests) see red plugin in latest patchbot report (which also gives two false positives that can be ignored)
comment:44 Changed 6 years ago by
Commit:  737c4e51196298e5bffbc3a79ca5a0311fd83f34 → 25934b5c05c112eaa6c451499a798ac846ba69e0 

Branch pushed to git repo; I updated commit sha1. New commits:
25934b5  last print phython3 style

comment:45 Changed 6 years ago by
Commit:  25934b5c05c112eaa6c451499a798ac846ba69e0 → 7db874b48bed1601bbcb115e307cfbfaabb2fd38 

Branch pushed to git repo; I updated commit sha1. New commits:
7db874b  constructions doc

comment:46 Changed 6 years ago by
Commit:  7db874b48bed1601bbcb115e307cfbfaabb2fd38 → 0e0d7da551b8539bbb5295d2200dae9bb9497f52 

Branch pushed to git repo; I updated commit sha1. New commits:
0e0d7da  still print

comment:47 Changed 6 years ago by
Commit:  0e0d7da551b8539bbb5295d2200dae9bb9497f52 → 2d369575b7d45ea77cf0d1c0d3118a7cd9ddd96e 

Branch pushed to git repo; I updated commit sha1. New commits:
2d36957  construction

comment:48 Changed 6 years ago by
Status:  new → needs_review 

comment:49 Changed 6 years ago by
doc does not build, and there remains oldstyle prints, see my patchbot's latest report
comment:50 Changed 6 years ago by
Commit:  2d369575b7d45ea77cf0d1c0d3118a7cd9ddd96e → 496bd4a46d3b257afd62e0dd8ab5ea2d91b36d89 

comment:51 Changed 6 years ago by
Commit:  496bd4a46d3b257afd62e0dd8ab5ea2d91b36d89 → c3aae43ae3d9a3462592759cd2f5f34c6afb9505 

Branch pushed to git repo; I updated commit sha1. New commits:
c3aae43  doc

comment:52 Changed 6 years ago by
Commit:  c3aae43ae3d9a3462592759cd2f5f34c6afb9505 → 45d380b0843995b30c47ebdc054f0dd1bdb9cfda 

Branch pushed to git repo; I updated commit sha1. New commits:
45d380b  doc

comment:53 Changed 6 years ago by
Commit:  45d380b0843995b30c47ebdc054f0dd1bdb9cfda → af880666e78263ebd519d8c79e4cb2d46cefbeb9 

Branch pushed to git repo; I updated commit sha1. New commits:
af88066  improve tests coverage

comment:54 Changed 6 years ago by
Commit:  af880666e78263ebd519d8c79e4cb2d46cefbeb9 → d35c1d2fcbb626332e8ad15a1fc98441edb4b0aa 

Branch pushed to git repo; I updated commit sha1. New commits:
d35c1d2  tests coverage

comment:55 Changed 6 years ago by
Hello Dominique, Thierry,
There are two current problems (see the failing doctests of patchbot):
 the comparison between elements of the free group changed. Before we had the following order on generators
x_0^1
,x_0
,x_1^1
,x_1
, ... But with your branch, because you use direct comparison on the Tietze generators, it becamex_n^1
,x_{n1}^1
, ...,x_0^1
,x_0
,x_1
, ..., I think the former was preferable. What do you think?
 there are a lot of failure related to the
free_group.py
being moved. You just need to change the occurrence ofsage.groups.free_group
bysage.groups.free_groups.free_group
everywhere.
comment:56 followup: 59 Changed 6 years ago by
No problem for the order of the generators and their inverses. However the reason for rewriting the _cmp_ method was that I want the neutral element to be smaller than all other elements of the free group. Which was not the case with the previous version.
I do not know how the previous order was implemented (deep inside GAP ?)
comment:57 Changed 6 years ago by
In the current Sage, it calls the comparison between the (lib)GAP objects; so my understanding is GAP handles the comparison.
comment:58 Changed 6 years ago by
Commit:  d35c1d2fcbb626332e8ad15a1fc98441edb4b0aa → 7a7da77df0eac29dc6b5783f023336cdaa44f51d 

Hello All,
My last commits do not appear in the ticket comments:
 I did my best to remove failures that appear in the patchchboot log (the make worked on my computer strange behavior?), and improve tests coverage, that seems to be a blocked point.
 For the order generators in my sens the remark from Vincent was about the previous version of free_group but the train_track version because a lot of order changed with the use of free_ group generators of Gap. But maybe, I confuse and the rewritting of _cmp method also change the orther.
Best regards Dominique
New commits:
f060b61  tests failures correction

7a7da77  tests failuures

comment:59 Changed 6 years ago by
Replying to coulbois:
No problem for the order of the generators and their inverses. However the reason for rewriting the _cmp_ method was that I want the neutral element to be smaller than all other elements of the free group. Which was not the case with the previous version.
It was...
sage: F = FreeGroup(['a','b']) sage: a,b = F.gens() sage: l = [a,b,~a,~b,a*b,~a*b,F.one()] sage: sorted(l) [1, a^1, a, b^1, b, a^1*b, a*b] sage: F.one() < a True sage: a < F.one() False
What is wrong with the above? It is first sorted by length and then (almost) lexicographically. This is indeed different from order on lists which is straight lexicographic.
I do not know how the previous order was implemented (deep inside GAP ?)
It indeed used the gap comparison which seems reasonable to me.
comment:60 Changed 6 years ago by
The ticket test failled status comes from a a problem with pathboot see http://ask.sagemath.org/question/33899/doctestfailinpatchbootandnotonmycomputer/
comment:61 Changed 6 years ago by
Commit:  7a7da77df0eac29dc6b5783f023336cdaa44f51d → c9da8b062929c663c865dbccd254790be7678c7f 

Branch pushed to git repo; I updated commit sha1. New commits:
c9da8b0  Merge branch 'public/traintrack' in 7.3.b9

comment:63 Changed 6 years ago by
Commit:  c9da8b062929c663c865dbccd254790be7678c7f → 857ff2ccd8cc8f743dbd11c55437ae78b2c02c51 

comment:64 Changed 6 years ago by
Status:  needs_work → needs_review 

The patchboot is now on test passed (TestsPassed? 7.3.rc0 Ubuntu/14.04/x86_64/3.13.092generic/librae), please review our work on train track for its intergration in sage
comment:65 Changed 6 years ago by
Commit:  857ff2ccd8cc8f743dbd11c55437ae78b2c02c51 → 8f9c87ceb239c1794029428eb01150cf372a310e 

Branch pushed to git repo; I updated commit sha1. New commits:
8f9c87c  try foreign latex failure

comment:66 Changed 6 years ago by
I do still plan on reviewing this, but I need some things to settle down first before I can do a largescale code review.
comment:69 Changed 6 years ago by
In the documentation of almost all examples of automorphism the information is duplicated as in
This is a pseudoAnosov mapping class of the 5punctured sphere. Thus this is not an iwip. However, its representative on the rose in traintrack. OUTPUT: an Automorphism of F_4 given in [BH] see also [Kapovich]. This is a pseudoAnosov mapping class of the 5punctured < exact copy! sphere. Thus this is not an iwip. However, its representative on the rose in traintrack.
comment:70 followup: 71 Changed 6 years ago by
Replying to vdelecroix:
what about 59? I see no need to change
_cmp_
.
the rewriting of _cmp_ order leads to some modifications outside free_group for tests, but I did changes, so I think is ok unless if there are some GAP reasons.
comment:71 Changed 6 years ago by
Replying to dbenielli:
Replying to vdelecroix:
what about 59? I see no need to change
_cmp_
.the rewriting of _cmp_ order leads to some modifications outside free_group for tests, but I did changes, so I think is ok unless if there are some GAP reasons.
This is precisely my question: why is _cmp_
changed at all?
comment:72 Changed 6 years ago by
Commit:  8f9c87ceb239c1794029428eb01150cf372a310e → a13b02db866233ef10c92a5670acf4176dc114b7 

Branch pushed to git repo; I updated commit sha1. New commits:
a13b02d  remove _cmp

comment:73 Changed 6 years ago by
Status:  needs_review → needs_work 

Hello,
Commenting is not removing. More importantly, you have to revert all the changes you have done in previous commits related to this change of comparison order.
comment:74 Changed 6 years ago by
Commit:  a13b02db866233ef10c92a5670acf4176dc114b7 → cd641776132ac1cc90be7e49e717c0101f9042d5 

Branch pushed to git repo; I updated commit sha1. New commits:
cd64177  remove __cmp and tests induced

comment:75 Changed 6 years ago by
Status:  needs_work → needs_review 

We revert to the _cmp_ method of FreeGroupElement? to that of the GAPwrapper (meaning that we removed the _cmp_ method from the free_groups/free_group.py file). Warning: this comparison is undocumented and it seems that it first compares the length of reduced words and then sort words of equal length in alphabetic order. In our traintrack package it is mainly used while running the NielsenWhitehead algorithm to invert automorphisms (see FreeGroupMorphism?.invert()). The order wrapped from GAP is satisfactory in this purpose.
We revert the doctests (that we had previously modified) from sage/groups/finitely_presented.py which use this order.
All doctests pass.
We now wait for other things to improve according to reviewers.
comment:76 Changed 6 years ago by
Hi Thierry, Hi Dominique,
The behavior is certainly documented in GAP. It might be worth to also have it (and test it) inside Sage. I am looking at the other pieces of your code now.
Vincent
comment:77 followup: 78 Changed 6 years ago by
Do you really need compare_letters
? Recall that cmp(...)
is going to disappear in python3.
comment:78 Changed 6 years ago by
You mean the compare_letters in AlphabetWithInverses? ?
Well, we really need to be carefull on the order of the alphabet. And I don't see a way around that. We need to have alphabets where each letter comes with an inverse, we need to be able to add and remove letters.
I agree that this is inspired by old versions of Words and Alphabet which now have disappeared from Sage.
The AlphabetWithInverses? is now only used by our InverseGraph? (and not by FreeGroup?), and we want to strictly comply with Serre's definition (see Arbres, amlagames, SL2, aka Trees).
comment:79 Changed 6 years ago by
there is only one compare_letters
in the git branch, and it seems not to be used anywhere (only appears in its own doc)
sorting should now generally be done using the keyword key=
instead of cmp=
comment:80 Changed 6 years ago by
The compare_letters
might be indirectly used in some word algorithm (though I doubt it).
comment:81 Changed 6 years ago by
there is no compare_letters
anywhere else in sage
(git grep "compare_letters")
comment:82 Changed 6 years ago by
Commit:  cd641776132ac1cc90be7e49e717c0101f9042d5 → 653a2510c2077063e1e0824d247d5d8852792a7a 

Branch pushed to git repo; I updated commit sha1. New commits:
653a251  compare_letters() removed as it is never used

comment:83 Changed 6 years ago by
Commit:  653a2510c2077063e1e0824d247d5d8852792a7a → ae9a96fbbbb800016ca9b0c13e7b77ced98dbab5 

Branch pushed to git repo; I updated commit sha1. New commits:
ae9a96f  Minor correction in the doc of FreeGroupAutomorphism.train_track() (due to my French mother tongue, more than two meant two or more + correction in the doc of TrainTrackMap.stabilize() to be more clear that the output is the folding map (not the traintrack map) + one correction for a case where that method returned False instead of the identity map

comment:84 Changed 6 years ago by
Commit:  ae9a96fbbbb800016ca9b0c13e7b77ced98dbab5 → d92640a431ce2ef957ca16b4113eb6abf986230d 

Branch pushed to git repo; I updated commit sha1. New commits:
d92640a  Merge branch 'public/traintrack' in 7.5.b2

comment:86 Changed 6 years ago by
I sent a question to https://ask.sagemath.org/question/35988/patchbootcoveragefailureandreview/ because I do not know what to do to fix it.
Hi sage team, My ticket #20154: traintracks in public/traintrack, is in needwork status, I guess the issue comes from coverage. But I do not see the fie ext/interpreters/wrapper_cc.pyx in my distribution , and for me this file doesn't belong to the ticket (that was true previously whent the patchboot works). I have absolutly no idea how to fix it, could you please tell me what to do to fix it and succes the review.
Thanks Dominique
========== coverage ========== git checkout patchbot/ticket_merged Already on 'patchbot/ticket_merged' Missing doctests in ext/interpreters/wrapper_cc.pyx: 0 / 2 = 0% Full doctests in groups/free_groups/convex_core.py: 18 / 18 = 100% Full doctests in groups/free_groups/free_group.py: 22 / 22 = 100% Full doctests in groups/free_groups/free_group_automorphism.py: 61 / 61 = 100% Full doctests in groups/free_groups/graph_map.py: 18 / 18 = 100% Full doctests in groups/free_groups/graph_self_map.py: 41 / 41 = 100% Full doctests in groups/free_groups/inverse_alphabet.py: 24 / 24 = 100% Full doctests in groups/free_groups/inverse_graph.py: 40 / 40 = 100% Full doctests in groups/free_groups/marked_graph.py: 16 / 16 = 100% Full doctests in groups/free_groups/test_train_track.py: 4 / 4 = 100% Full doctests in groups/free_groups/train_track_map.py: 23 / 23 = 100% Coverage went from 41463 / 43258 = 95.850% to 41711 / 43508 = 95.870%
comment:87 Changed 6 years ago by
This kind of patchbot report you can safely ignore. The patchbot is not perfect, and sometimes gives wrong failures. Patchbot is only here to help, not to be taken as an absolute requirement.
The problem now is that you need to rebase your branch on the latest beta, because there is a conflict (this make the branch red at top of the present page)
comment:88 Changed 6 years ago by
Commit:  d92640a431ce2ef957ca16b4113eb6abf986230d → 48df86fc72846c91a5e1082b6cbf4d1ad1fd746b 

Branch pushed to git repo; I updated commit sha1. Last 10 new commits:
3bd8e1c  tests failuures

143eb01  test coverage

d53d06a  try foreign latex failure

8551333  remove _cmp

6774b7f  remove __cmp and tests induced

283c702  compare_letters() removed as it is never used

fd8ddec  Minor correction in the doc of FreeGroupAutomorphism.train_track() (due to my French mother tongue, more than two meant two or more + correction in the doc of TrainTrackMap.stabilize() to be more clear that the output is the folding map (not the traintrack map) + one correction for a case where that method returned False instead of the identity map

c060ab1  small typo

c4a2309  fusion

48df86f  merge bug

comment:89 Changed 6 years ago by
Commit:  48df86fc72846c91a5e1082b6cbf4d1ad1fd746b → 514cff1e78b99abdb4300362e8828e76cc5f94ac 

Branch pushed to git repo; I updated commit sha1. New commits:
514cff1  correction for python3

comment:90 Changed 6 years ago by
Commit:  514cff1e78b99abdb4300362e8828e76cc5f94ac → d9256f7d18063828a66c3a782698b5a9e389d446 

Branch pushed to git repo; I updated commit sha1. New commits:
d9256f7  nothing

comment:91 Changed 6 years ago by
Status:  needs_work → needs_review 

I think I have corrected all python3 troubles, even though the patchboot did not give new result since 20161214, I think it ok for review
comment:92 Changed 6 years ago by
Because you are not yet trusted, I have to launch my personal bot manually.
Result:
 some failing doctests
 some bad unicode character (maybe add uft8 declaration at top of file ?)
 need to replace <type 'str'> by <... 'str'> for python3 compatibility
see patchbot report for more
comment:93 Changed 6 years ago by
Commit:  d9256f7d18063828a66c3a782698b5a9e389d446 → 9f3c92f786a99d2e4d38cf650d43b26327a1b472 

Branch pushed to git repo; I updated commit sha1. New commits:
9f3c92f  pthshoot coorected

comment:94 Changed 6 years ago by
You should rebase this on the most recent version of Sage: I think the doctest failures are because of new code that uses free groups and imports it from its old location, leading to deprecation warnings.
comment:95 Changed 6 years ago by
Many thanks for your help, I corrected the bad UTF8 unicode from python 2. And its seems to work with the new rebase version too. I cross fingers my last commit pass the pathboot, and the ticket can pass.
comment:96 Changed 6 years ago by
Milestone:  sage7.3 → sage8.0 

Status:  needs_review → needs_work 
does not apply
comment:97 Changed 6 years ago by
Commit:  9f3c92f786a99d2e4d38cf650d43b26327a1b472 → 125259102f7f65182ed3d7acda07b8fae016a2a5 

comment:98 Changed 6 years ago by
I've done the rebase to the current Sage version and did a little bit of doc cleanup and other small tweaks. It still needs a complete doc readthrough (I maybe got through 30%). There are some references that seem like they needed to be added.
comment:99 Changed 6 years ago by
Hi,
Thanks for your update for the new version 8, Unfortunately my version obtained by pull is not working, I do not understand what happens.
Otherwise I would like to succes the review, and I would know what is missing, and I can do.
Thanks for help
Dominique
PS error message of doc build
Error building the documentation. Traceback (most recent call last):
File "/home/dominique/projets/sage/local/lib/python2.7/runpy.py", line 174, in _run_module_as_main
"main", fname, loader, pkg_name)
File "/home/dominique/projets/sage/local/lib/python2.7/runpy.py", line 72, in _run_code
exec code in run_globals
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/main.py", line 2, in <module>
main()
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 1640, in main
builder()
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 510, in _wrapper
build_many(build_ref_doc, L)
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 266, in build_many
results.append(target(arg))
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 70, in build_ref_doc
getattr(ReferenceSubBuilder?(doc, lang), format)(*args, kwds)
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 720, in _wrapper
getattr(DocBuilder?, build_type)(self, *args, kwds)
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/init.py", line 104, in f
runsphinx()
File "/home/dominique/projets/sage/local/lib/python2.7/sitepackages/sage_setup/docbuild/sphinxbuild.py", line 215, in runsphinx
raise exception
OSError: [manifolds] /home/dominique/projets/sage/src/doc/en/reference/manifolds/index.rst:4: WARNING: undefined label: tensorsonfreemodules (if the link has no caption the label must precede a section header)
comment:100 Changed 6 years ago by
Try running make docclean && make
.
One of the most tedious things is to bring the doc formating similar to the changes I made (see also the sage dev guide). I will try to go through the code itself soon too.
comment:101 Changed 5 years ago by
Commit:  125259102f7f65182ed3d7acda07b8fae016a2a5 → 747f50449e955cc56ad13b846118556dd2c43960 

Branch pushed to git repo; I updated commit sha1. New commits:
747f504  minor typos in docstring corrected

comment:102 Changed 5 years ago by
Many thanks you very munch for your upgrade,
the make docclean && make is now ok
Do you think we can go back on need review status?
comment:103 Changed 5 years ago by
Someone still needs to go through and standardize the docstrings to use Sage's conventions (comment:100). In addition to the changes I made, you can also use the
Sage conventions page,
although the INPUT:
items should not end in periods/full stops/.
(unless they are really long) and you do not need an INPUT:
block if there is no input (self
does not count) or an OUTPUT:
if the output is clear from the 1line doc. I will go back to looking through the code once that is done.
This also needs a (likely trivial) rebase on the latest develop
version.
comment:104 Changed 5 years ago by
Commit:  747f50449e955cc56ad13b846118556dd2c43960 → 3a4bf05c356506567cf3e84fd7a9402b6960d71a 

Branch pushed to git repo; I updated commit sha1. New commits:
3a4bf05  minor typo

comment:105 Changed 5 years ago by
Commit:  3a4bf05c356506567cf3e84fd7a9402b6960d71a → c1805dbcd2b10672344b1bb2f474f01a97500fa0 

Branch pushed to git repo; I updated commit sha1. New commits:
c1805db  merge with develop branch

comment:106 Changed 5 years ago by
Commit:  c1805dbcd2b10672344b1bb2f474f01a97500fa0 → b81e62dfbb002bf48688c259005f2875fc66727b 

Branch pushed to git repo; I updated commit sha1. New commits:
b81e62d  INPUT end . correction

comment:107 Changed 5 years ago by
Hi,
I done the rebase and the correction for INPUT intems end with . only where there are long. Tell me if it is ok for a need review now
Thanks Dominique
comment:108 Changed 5 years ago by
Still a lot of doc issues (see also comment:19):
 You need to replace
$
with`
.  What does
\index{Nielsen path}
do? I think it will not do what you want with the build documentation.  Are the macros
\CVN
and\FN
defined? If not, you probably want to replace them with the corresponding true Latex code (rather than add to the macro list).  Use
\ZZ
instead of\mathbb Z
.  References should go in the master reference file
doc/en/reference/references/index.rst
and have more descriptive names.  Format like:
def foo(self): """ Short description. ... """
 Your ascii art square for
ConvexCore
should beis of the form::
(with a double colon). Although having spaces here will be better than the.
. The doc should not have any trouble getting this to look nice.  There are a number of variables that should be either formatted for latex (
`x`
) or code (``x``
). In particular, things like``False``
should be code formatted.  It is better to put inputs for
__init__
in the classlevel docstring so it will be visible.
Some code issue I noticed on a quick readthrough:
 It would be good to provide some sort of deprecation warnings for all nonhidden functions/classes (i.e., not
_lexi_gen
). See the deprecation option oflazy_import
.  Use newstyle Python clases:
class ConvexCore(object):
. Although can the user ever see it? If so, perhaps it should inherit fromSageObject
.  Never check things like
if x is True:
(resp.False:
); simply doif x:
(resp.if not x:
).  It is faster to check
if todo:
instead ofif len(todo) > 0
.  Instead of
__str__
, if it is a SageObject? subclass, you should use_repr_
(e.g., subclasses ofDiGraph
). Otherwise, we prefer to use__repr__
. groups/free_groups/test_train_track.py
might be better astests/train_tracks.py
.
comment:110 Changed 5 years ago by
Commit:  b81e62dfbb002bf48688c259005f2875fc66727b → 573701b06cccc7e2fa3982534e86cc4e8d8a990b 

Branch pushed to git repo; I updated commit sha1. New commits:
573701b  some correction from tscrim comments

comment:111 Changed 5 years ago by
Commit:  573701b06cccc7e2fa3982534e86cc4e8d8a990b → dcc540c770298bac710358c72e35c9ea3961bcde 

Branch pushed to git repo; I updated commit sha1. New commits:
dcc540c  some correction from tscrim comments

comment:112 Changed 10 months ago by
Description:  modified (diff) 

Milestone:  sage8.0 → sagewishlist 
Let me know if you have any questions or if there is anything I can do to help.
In case you were unaware, you might also be interested in that Sage has an implementation of rightangled Artin groups.