[Next][Prev] [Right] [Left] [Up] [Index] [Root]

Implementation Notes

The algorithms for recognizing Frobenius elements in Galois groups are described in [DD10]. They rely on the cycle type identification, Serre's trick for alternating groups and the general machinery from [DD10]. Magma is usually able to handle Galois groups of size <10000 acting on a small number of points easily, and much larger special groups such as An and Sn.

 [Next][Prev] [Right] [Left] [Up] [Index] [Root]

Version: V2.19 of Wed Apr 24 15:09:57 EST 2013