Hi,
There was in sage-combinat queue a patch of Mike that add to
Permutation a decorator @combinatorial_class_from_iterator for
burhat_succ and bruhat_pred in order to return a CombinatorialClass
and not a list. In #12518, I replaced it with @set_from_method which
should be the new version of comb
Nicolas,
Many thanks for implementing the full affine weight lattice!
What is the rationale behind sometimes returning a function
(for example, a simple reflection in a Weyl group,
acting in a weight/root lattice/space)
and sometimes providing an element method (in the above case,
for an element
On Sun, Mar 11, 2012 at 11:45:50AM +0100, Jean MICHEL wrote:
> The choice in CHEVIE was made such that it is possible without relabelling
> to embed B_n into B_{n+1}, D_n into D_{n+1}, E_n into E_{n+1} ...
Definitely a nice feature!
Is this convention known under some name? Or shall we just go fo
On Sat, Mar 10, 2012 at 01:09:04PM -0500, Salvatore Stella wrote:
> at the moment I am unable to pull: the update fails when applying
> trac_6588-categories-root_systems-review-nt.patch
> which was pushed to the queue some hours ago.
Oops, sorry, my fault! This should be fixed now.
Gosh, I had ch
Just a comment
On Sun, Mar 11, 2012 at 11:24:57AM +0100, Nicolas M. Thiery wrote:
> > > # the convention for the exceptional node in types B/C is the other
> > > choice that in chevie (compare
> > > http://www.math.jussieu.fr/~jmichel/gap3/htm/chap071.htm):
> > >
> > > sage: x = CartanType(['B',4]
Hi Christian, Anne,
Thanks Christian for bringing up this todo list.
On Sat, Mar 10, 2012 at 11:50:46AM -0800, Anne Schilling wrote:
> > # the first and the second seem to behave very differently:
> >
> > sage: x = CartanType([['A',4]])
> > sage: type(x)
> > > 'sage.combinat.root_system
