Le dimanche 24 juillet 2011 à 15:38 -0700, Dima Pasechnik a écrit :
> On Sunday, 24 July 2011 22:37:05 UTC+1, Rafael T wrote:
>
> The gap-system already has the ability to work with Coxeter
> groups:
> http://www.gap-system.org/Gap3/Manual3/C075S005.htm Maybe I
>
Le lundi 25 juillet 2011 à 04:47 -0700, Martin Raum a écrit :
> Hello all,
Hello Martin,
> I happened to think about Sidon g-sets and to do some computations I
> implemented a recursive enumeration of such sets. Clearly, this would
> go into the combinatorics tree. I am not an expert in combinato
Hi,
> To get the implementation of Coxeter groups in Sage, there is a lot of
> things to do yourself.
First, you need to install gap3 WITH THE chevie package on your
machine. You can get a compiled version with everything ready to go on
Jean Michel's webpage, http://www.math.jussieu.fr/~jmichel/g
Dear combinat-developers,
for my research I would lik to study the species of series-parallel
networks.
In EOIS as sloane.A006351 they propose the combstruct-code
spec := [ N, {N=Union(Z, S, P), S=Set(Union(Z, P), card>=2),
P=Set(Union(Z, S), card>=2)}, labeled ]:
How can I make that using sage-
> This package is still UNDER CONSTRUCTION, so it is definitely BUGGY,
> and methods might CHANGE their behaviour or get RENAMED. But feel free
> to play around! If you have any questions (or have further problems
> with the installation), find bugs, or think behaviour is strange or
> unexpected, o
