Hello Users,
Is there any function in GAP that calculate of all endomorphisms of
groupring (or group algebra)?
There is a similiar function for groups in sonata share package name as
Endomorphisms.
Best wishes
Alper Odabas
___
Forum mailing
Hello all!
I've been using GAP for some time now and I'm wondering why the
Permutations-function is called PermuationsList, the Partitions-function
PartitionsSet and the Combination-function simply Combinations.
They all return a set, so why is there this difference?
Lisette
Hello everybody!
Is there a function in GAP that returns all possible pairs of disjoint
combinations of a (subset of a) list?
So if I have for example a list [1,2,3,4,5] it should return:
[ [1,2],[3,4] ]
[ [1,2],[3,5] ]
[ [1,2],[4,5] ]
...
[ [1,2],[3] ]
[ [1,2],[4] ]
...
[ [1,2,3],[4,5] ]
[ [1,2
On 2011-11-16, at 00:32 , Lisette Brillemans wrote:
> Hello everybody!
>
> Is there a function in GAP that returns all possible pairs of disjoint
> combinations of a (subset of a) list?
There isn't a single function, but you can easily build one. Essentially two
nested for-loops. A short way
Hello
I defined a function 'pair' as:
pair:=function(x,y) return[x,y]; end;
Also I defined
a:=[1,2,3,4];
And discovered something strange:
Although the output of
ListX(Combinations(a,2),Combinations(a,2),\<,pair);
is
> [ [ [ 1, 2 ], [ 1, 3 ] ], [ [ 1, 2 ], [ 1, 4 ] ], [ [ 1, 2 ], [
