#6839: [with patch, positive review] Implementation of crystal of letters for 
type
E7
-----------------------------------------+----------------------------------
 Reporter:  aschilling                   |        Owner:  aschilling       
     Type:  enhancement                  |       Status:  closed           
 Priority:  major                        |    Milestone:  sage-4.1.2       
Component:  combinatorics                |   Resolution:  fixed            
 Keywords:  combinat, crystals           |     Reviewer:  Daniel Bump      
   Author:  Anne Schilling, Brant Jones  |       Merged:  Sage 4.1.2.alpha1
-----------------------------------------+----------------------------------
Changes (by mvngu):

  * status:  new => closed
  * milestone:  sage-combinat => sage-4.1.2
  * reviewer:  bump => Daniel Bump
  * resolution:  => fixed
  * merged:  => Sage 4.1.2.alpha1


Comment:

 The following docstring causes warnings when building the reference
 manual:
 {{{
 1287        TESTS::
 1288
 1289        sage: C = CrystalOfLetters(['E',7])
 1290        sage: C.module_generators
 1291        [[7]]
 1292        sage: C.list()
 1293        [[7], [-7, 6], [-6, 5], [-5, 4], [-4, 2, 3], [-2, 3], [-3, 1,
 2], [-1,
 1294        2], [-3, -2, 1, 4], [-1, -2, 4], [-4, 1, 5], [-4, -1, 3, 5],
 [-3, 5],
 1295        [-5, 6, 1], [-5, -1, 3, 6], [-5, -3, 4, 6], [-4, 2, 6], [-2,
 6], [-6, 7,
 1296        1], [-1, -6, 3, 7], [-6, -3, 7, 4], [-6, -4, 2, 7, 5], [-6,
 -2, 7, 5],
 1297        [-5, 7, 2], [-5, -2, 4, 7], [-4, 7, 3], [-3, 1, 7], [-1, 7],
 [-7, 1],
 1298        [-1, -7, 3], [-7, -3, 4], [-4, -7, 2, 5], [-7, -2, 5], [-5,
 -7, 6, 2],
 1299        [-5, -2, -7, 4, 6], [-7, -4, 6, 3], [-3, -7, 1, 6], [-7, -1,
 6], [-6,
 1300        2], [-2, -6, 4], [-6, -4, 5, 3], [-3, -6, 1, 5], [-6, -1, 5],
 [-5, 3],
 1301        [-3, -5, 4, 1], [-5, -1, 4], [-4, 1, 2], [-1, -4, 3, 2], [-3,
 2], [-2,
 1302        -3, 4], [-4, 5], [-5, 6], [-6, 7], [-7], [-2, 1], [-2, -1, 3]]
 1303        sage: C.check()
 1304        True
 1305        sage: all(b.f(i).e(i) == b for i in C.index_set() for b in C
 if b.f(i) is not None)
 1306        True
 1307        sage: all(b.e(i).f(i) == b for i in C.index_set() for b in C
 if b.e(i) is not None)
 1308        True
 1309        sage: G = C.digraph()
 1310        sage: G.show(edge_labels=true, figsize=12, vertex_size=1)
 }}}
 See #6901 for a follow-up to this ticket.

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6839#comment:6>
Sage <http://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