Back to search

CSUniversity San Bernardino

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

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Computer Science and Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Harris, Elena Yavorska

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/2432

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Harris, Elena Yavorska. A parallel algorithm to solve the mathematical problem "double coset enumeration of S₂₄ over M₂₄". Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/2432