Re: [sage-combinat-devel] Re: [sage-devel] Re: Refactoring of posets

2011-04-13 Thread Christian Stump
Salut Nicolas, I was just brainstorming of how to use PairwiseCompatibleSubsets to construct not only antichains but also chains and multichains in posets. It might be a good optional argument fixing a given size, or fixing a given maximal size of subsets. chains of a given length then become stra

Re: [sage-combinat-devel] Re: [sage-devel] Re: Refactoring of posets

2011-04-13 Thread Christian Stump
> There is also a bug to fix in HasseDiagram. Maybe I add another patch > after 10998, that's easier to review then... I added another patch doing this after 10998, its number is 11187. I like the facade option for posets, I use it in the finite reflection group code for constructing the noncross

Re: [sage-combinat-devel] Re: [sage-devel] Re: Refactoring of posets

2011-04-13 Thread Christian Stump
> Otherwise I would change this and add it to my review patch... There is also a bug to fix in HasseDiagram. Maybe I add another patch after 10998, that's easier to review then... -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post t

Re: [sage-combinat-devel] Re: [sage-devel] Re: Refactoring of posets

2011-04-13 Thread Christian Stump
Salut Nicolas, I was just creating some lattices and saw that LatticePoset does not take the same input as Poset. Have you touched the patch these days? Otherwise I would change this and add it to my review patch... Best, Christian -- You received this message because you are subscribed to the

[sage-combinat-devel] Re: [sage-devel] Re: Of powersets and subsets

2011-04-13 Thread Stefan van Zwam
Hi Florent, > > I was on a long week end and Nicolas is on vacation for the entire week. So > expect some delay in the answers. > No worries! We're not in a hurry. > First of all the dictionary approach as you call it is very classical in > combinatorics. It think it is a good idea here. We use t

Re: [sage-combinat-devel] finite complex reflection groups and matrices over the universal cyclotomic field

2011-04-13 Thread Christian Stump
Salut, I just pushed a new version of the patch implementing finite reflection groups - it is now also on the trac server with ticket number #11187. It contains many of the suggestions you made - including various possibilities of indexing (generating, distinguished, all) reflections. Also, every

Re: [sage-combinat-devel] Re: Big cleanup in partitions and permutations

2011-04-13 Thread Vincent Delecroix
Hello Florent, There are 20 lines at the begining of the patch improve_constructors_of_iet-vd.patch which modify permutation.py (the __init__ method). See the following thread http://groups.google.com/group/sage-combinat-devel/browse_thread/thread/354f6e841ae5cc58 Cheers, Vincent -- You rece

Re: [sage-combinat-devel] Re: Big cleanup in partitions and permutations

2011-04-13 Thread Nicolas Borie
Hi, I don't know if you intend to touch it but I have a modification in sage/groups/perm_gps/permgroup_element.pyx I had the following method: cpdef list _act_on_list_on_position(self, list x): """ Returns the right action of ``self`` on the list ``x``. This is the action on positi

Re: [sage-combinat-devel] Re: Big cleanup in partitions and permutations

2011-04-13 Thread Florent Hivert
On Tue, Apr 12, 2011 at 02:26:41AM -0700, Nathann Cohen wrote: > > > > > - use a much more compact and memory efficient C/Cython data structure; > > - allows to cythonize efficiently all the small methods; > > > If you need some reviews on this kind of tickets, count me in ! :-) Cool ! Florent