Breadcrumb

 
 

Distinguishing permutation isomorphism classes of groups

Title:

Distinguishing permutation isomorphism classes of groups

Lau, Kwok-On (1992) Distinguishing permutation isomorphism classes of groups. Masters thesis, Concordia University.

[img]
Preview
PDF
2860Kb

Abstract

The ability to distinguish permutation isomorphism classes of groups is an important step in the computation of Galois groups of polynomials over the rationals. In order to distinguish permutation isomorphism classes of groups, it is useful to have an extensive list of their invariants. These invariants include properties such as the order, imprimitivity, parity and shapes, as well as the orbit lengths of sets and sequences. Computing these characteristics can be extremely time consuming. In this thesis, a detailed description of efficient algorithms for solving the problem using the concept of expanding horizon and orbit computation is presented.

Divisions:Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Lau, Kwok-On
Pagination:x, 94 leaves ; 29 cm.
Institution:Concordia University
Degree Name:Theses (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:1992
Thesis Supervisor(s):Lam, C. W. H
ID Code:3045
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 15:23
Last Modified:08 Dec 2010 10:30
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer