Return to search

A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄"

This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the double coset M₂₄ P M₂₄, where P is a permutation on n points of a certain cycle structure, and M₂₄ is the Mathieu group related to a Steiner system S(5, 8, 24) as its automorphism group. The purpose of this work is not to replace the existing algorithms, but rather to explore a possibility to extend calculations of single cosets beyond the limits encountered when using currently available methods.

Identiferoai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-project-3449
Date01 January 2003
CreatorsHarris, Elena Yavorska
PublisherCSUSB ScholarWorks
Source SetsCalifornia State University San Bernardino
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceTheses Digitization Project

Page generated in 0.0019 seconds