[GAP Forum] Fw: Finding the maximal subgroup ...

Steve Linton sal at dcs.st-and.ac.uk
Fri Oct 22 13:01:12 BST 2004

This came to the old address.

Begin forwarded message:

Date: Fri, 22 Oct 2004 12:46:11 +0200
From: Jan Draisma <Jan.Draisma at unibas.ch>
To: GAP Forum <GAP-Forum at dcs.st-and.ac.uk>
Subject: Re: Finding the maximal subgroup ...

Dear GAP-Forum and Dursun,

> Let V be an m dimensional subspace of R^n. Let S_n act on R^n and on V
> by permuting the coordinates of each vector in R^n. Thus S_n acts on R^n
> regularly.
> 	I was wondering whether there is any tool in GAP that I could
> use to find the maximal subgroup G of S_n such that V remains invariant
> under this action.  Obviously one can fix a basis for V and compute the
> symmetry group of the matrix formed by putting these basis vectors into
> a matrix. This symmetry group would be a subgroup of of G but I would
> like to be able to compute G or some subgroup of G that has as many
> elements of G as possible.

The brute force code below will work for those n for which listing all
elements of S_n is feasible. There should be more efficient algorithms,
though, using (the code for) `Stabiliser'. Over finite fields, one may
try to implement Grassmannians and compute the stabiliser of V there.

# V is a subspace of F^n for some field F, and this returns the
# subgroup of S_n stabilising V.
local B,Ann,Zo,L,n;

if Dimension(V)=0 then return(SymmetricGroup(Length(AsSet(V)[1])));

Ann:=TransposedMat(NullspaceMat(TransposedMat(B)));     #eqs defining
Zo:=B*Ann;                                              #zero matrix
        (List(B,v->Permuted(v,pi))*Ann = Zo));
return Group(L);



Group([ (), (1,2), (4,5), (1,2)(4,5) ])

Best wishes,


Steve Linton	School of Computer Science  &
      Centre for Interdisciplinary Research in Computational Algebra
	     University of St Andrews 	 Tel   +44 (1334) 463269
http://www.dcs.st-and.ac.uk/~sal	 Fax   +44 (1334) 463278   

More information about the Forum mailing list