Hi Anne, Thank you. I would be very happy to come to the Sage Days at ICERM in July. I don't have any source of funding for travel or accomodation and will apply to ICERM.
As for the wish list: I would like to implement Sami Assaf's dual equivalence graphs and descent sets on standard ribbon tableaux. I have a construction which gives me the operations arising arising from jeu-de-taquin for standard ribbon tableaux; namely, rectification, promotion, evacuation. I intend to implement this. I would like to extend these operations to semistandard ribbon tableaux; this requires coming up with Bender-Knuth involutions on semistandard ribbon tableaux. Best Wishes, Bruce On Monday, 14 May 2018 20:18:48 UTC+1, Anne Schilling wrote: > > Hi Bruce, > > I think this is very early code written by Mike Hansen and is not in the > format that a lot of other code > in combinatorics is in. Since Franco Saliola and I actually recently ran > into the same problems with this > code, I suggest that we make this a priority for the Sage Days at ICERM in > July. Would you be able to > attend those? > > Also, could you make a wishlist what you would want to do with ribbon > tableaux? > > Best wishes, > > Anne > > On Monday, May 14, 2018 at 11:30:38 AM UTC-7, Bruce Westbury wrote: >> >> Thanks Travis, i agree with your comments. My complaint is not just that >> the functionality is not there (as you say, someone has to write it) but >> that it has not been organised in a way that makes it simple for me to >> implement the functionality I am interested in. >> Before I can start I have to figure out how to convert from the current >> implementation to a chain of partitions. Apart from having a gripe, I >> wanted to check it was not there and I hadn't found it. It seems it is not >> implemented. >> >> I am confused about why this is a Tableau class if it doesn't implement >> Tableau methods. >> >> On Sunday, 13 May 2018 23:38:22 UTC+1, Travis Scrimshaw wrote: >>> >>> Hi Bruce, >>> This is certainly an underdeveloped class in Sage. My understanding >>> is that the implementation is primarily designed to compute (co)spin >>> polynomials. However, there is documentation that probably should be added >>> to the parent class. In particular, the 0's are all values that are >>> uniquely determined by the values and positions of the non-0 entries and >>> k-ribbon semistandardness, which is mentioned in the RibbonTableau doc >>> (albeit a bit too briefly). +1 for adding more functionality, but it does >>> need someone to add it. >>> >>> Best, >>> Travis >>> >>> >>> On Monday, May 14, 2018 at 3:55:18 AM UTC+10, Bruce Westbury wrote: >>>> >>>> I am finding the Ribbon Tableaux class frustrating. There seems to be >>>> no functionality. >>>> >>>> If you create a ribbon tableau and look at it, it does not look like a >>>> tableau >>>> and no interesting methods work because it does not look like a tableau >>>> to sage. >>>> >>>> As far as I am concerned, a ribbon tableau is an increasing sequence of >>>> partitions such that >>>> each difference is a ribbon shape. Although I can see how to get this >>>> sequence by hand >>>> from the sage representation of a ribbon tableau I have not found any >>>> way of getting sage >>>> to produce this list. Am I missing something? >>>> >>> -- You received this message because you are subscribed to the Google Groups "sage-devel" 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 https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
