#14052: Enabling plotting of top graded piece of infinite dimensional crystals
-----------------------------------------------+----------------------------
       Reporter:  aschilling                   |         Owner:  sage-combinat  
                    
           Type:  enhancement                  |        Status:  needs_info     
                    
       Priority:  major                        |     Milestone:  sage-5.7       
                    
      Component:  combinatorics                |    Resolution:                 
                    
       Keywords:  crystals, digraph, plotting  |   Work issues:                 
                    
Report Upstream:  N/A                          |     Reviewers:  Nicolas M. 
Thiery, Travis Scrimshaw
        Authors:  Anne Schilling               |     Merged in:                 
                    
   Dependencies:                               |      Stopgaps:                 
                    
-----------------------------------------------+----------------------------

Comment (by nthiery):

 Salut Sébastien!

 Replying to [comment:6 slabbe]:
 > The patch I just uploaded shows how I think it should be done : adding
 an argument to the iterator method. My patch should create some conflicts
 with yours, I am sorry for that. Do you want to rebase your patch on mine?
 >
 > What my patch do not do for now is to deprecate this
 {{{TransitiveIdealGraded}}} class. This could be done in another ticket
 (in #6637 perhaps?). Anyhow, since I believe we should deprecate that
 class, I also think we should avoid to add new features to it.

 Thanks much for working on the refactoring of backtrack.py; we need it!

 That being said, TransitiveIdeal itself is going to get deprecated in
 the process since we want a consistent naming scheme around
 RecursiveSet (that's the name we converged to on the mailing list,
 right?). So either way, adding an argument to TransitiveIdealGraded or
 adding a breath first search iterator in TransitiveIdeal is also
 adding features to to-be-deprecated classes.

 Also, in the long run, we will want the following features for a
 recursively defined set S:

 (1) Build a parent modeling the top piece of S
 (2) Build a parent modeling an upper ideal of S
 (3) Build a parent modeling S, with depth first enumeration
 (4) Build a parent modeling S, with breath first enumeration
 (5) ...

 and not only have iterators for the above. And it's helpful for Anne
 to have the feature right away for (1).

 So altogether, given that Anne's ticket is ready to go and is
 important for later development here during the semester, do you mind
 letting it go as is and rebasing your patch on top of it? We can add a
 quick note saying that this feature will be refactored (as all the
 rest).

 Cheers,
                                 Nicolas

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14052#comment:7>
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 unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.


Reply via email to