[sage-combinat-devel] Le diagrams and permutation tableaux

2014-02-04 Thread Christian Stump
Hi there, I wonder if someone already has code for Postnikov's Le diagrams. These are fillings of partitions fitting in a box with 0's and 1's with the additional property that no 0 has a 1 in the same column AND to its left in the same row. My aim is to get Le diagrams (or maybe the subclass of

Re: [sage-combinat-devel] Le diagrams and permutation tableaux

2014-02-04 Thread Darij Grinberg
Hi Christian, I fear I'm going to derail this a bit but I actually care about hearing answers to these questions... The way you speak of Le-diagrams, they are fillings of partitions with 0's and 1's. But from a quick look at Postnikov's paper, it seems that they are better regarded as subsets of

[sage-combinat-devel] Re: Branching Rules

2014-02-04 Thread Vít Tuček
There is a typo at http://sporadic.stanford.edu/thematic_tutorials/lie/weyl_groups.html We may ask when this permutation is trivial. If it is nontrivial it induces an automorphism of the Dynkin diagram, so it must be nontrivial when the Dynkin diagram has no automorphism. But if there is a

Re: [sage-combinat-devel] sage-combinat poster

2014-02-04 Thread Anne Schilling
On 1/26/14 1:53 PM, Nicolas M. Thiery wrote: On Thu, Jan 23, 2014 at 09:55:23AM -0800, Anne Schilling wrote: It is time to update our poster again! The current poster can be found at http://combinat.sagemath.org/misc/file/b82a003ca596/articles/2013-01-17-Poster/main.pdf If you have any