Changes between Initial Version and Version 1 of Ticket #15621, comment 3


Ignore:
Timestamp:
Jan 3, 2014, 8:55:06 PM (9 years ago)
Author:
Andrew Mathas
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #15621, comment 3

    initial v1  
    1414I have an implementation of the class that is needed for the Fock spaces in {{{u/andrew.mathas/combinat/tableaux_residues}}} where they are called {{{KleshchevPartitions}}} in {{{partition_tuple.py}}}. If I haven't misread what your code does I would be happy to help in trying to merge these two branches  --  I don't care what the class is called. My code first implements "good node sequences" for partition tuples. This is the combinatorial data that you need to describe the realisation of the crystal graph that corresponds to the Fock space. The iterator for {{{KleshchevPartitions}}} then, in effect, constructs the crystal graph.
    1515
    16 I wasn't planning on putting this code into sage any time soon because I thought that no one was interested in it apart from me. As a result I haven't properly tested my code, although it is documented and it probably works:) It is also worth mentioning that your Fock space code should give another way of constructing these partition (tuples) using the degrees of the higher level "LLT polynomials" that arise (so it shouldn't need this class). Finally, unfortunately, there are at least four different natural conventions for these objects, all of which are probably used by some one -- in level 1, there are two natural choices related by conjugation of partitions and in higher levels you can conjugate and reverse the order of the partitions in the tuple.
     16I wasn't planning on putting this code into sage any time soon because I thought that no one was interested in it apart from me -- although it is already avalable on git. As a result I haven't properly tested my code, although it is documented and it probably works:) It is also worth mentioning that your Fock space code should give another way of constructing these partition (tuples) using the degrees of the higher level "LLT polynomials" that arise (so it shouldn't need this class). Finally, unfortunately, there are at least four different natural conventions for these objects, all of which are probably used by some one -- in level 1, there are two natural choices related by conjugation of partitions and in higher levels you can conjugate and reverse the order of the partitions in the tuple.
    1717
    1818Andrew