> < ^ Date: Wed, 13 Jun 2001 15:02:39 +0200 (MET DST)
> ^ From: Pamb <pamb@mathematik.uni-wuerzburg.de >
> ^ Subject: Question on appropriateness of GAP for solving a particular problem

Here is my question:

I have a set S with 30 elements, together with a symmetric binary relation R, which
holds between some of the elements of S. I would like to find out all the
permutations of S which preserve the relation R, in the following precise sense
f: S to S, f bijection satisfying "a R b if and only if f(a) R f(b)".

Is there any program in GAP that would allow me to do that?

Thanks, Victor

Miles-Receive-Header: reply

> < [top]