#6812: Enumerate integer vectors modulo to the action of a Permutation Group
------------------------------------------------------------------+---------
       Reporter:  nborie                                          |         
Owner:  nborie                                                  
           Type:  enhancement                                     |        
Status:  needs_review                                            
       Priority:  major                                           |     
Milestone:  sage-5.1                                                
      Component:  combinatorics                                   |    
Resolution:                                                          
       Keywords:  enumeration, integer, list, permutation, group  |   Work 
issues:  long time tests, information about listing infinite sets
Report Upstream:  N/A                                             |     
Reviewers:  Karl-Dieter Crisman, Simon King                         
        Authors:  Nicolas Borie                                   |     Merged 
in:                                                          
   Dependencies:                                                  |      
Stopgaps:                                                          
------------------------------------------------------------------+---------

Comment (by nborie):

 Thanks for this comment and for the further to come. There are probably
 much more things to improve in the current code. I hope the current patch
 can allow you to play with invariants of permutation groups. However, I
 won't touch this patch anymore until one or two weeks. I am sorry but I
 need to prepare important dates for my future. I have an audition Tuesday
 for an associate professor position in the Faugère'team PolSys and I must
 focus my work around the preparation of such appointments.

 Anyway, I will read all this page once I could come back to this stuff.
 Feel free to give some comments and commands around this module to improve
 the code.

 the algorithmic details are explain in French in (with some Benchmarks):
 http://tel.archives-
 ouvertes.fr/docs/00/65/67/89/PDF/VD2_BORIE_NICOLAS_07122011.pdf
 It is from page 39 to 51. It is in French but pictures should make things
 easy to understand.

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6812#comment:62>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en.

Reply via email to