You are here

Construction of combinatorial designs with prescribed automorphism groups

Download pdf | Full Screen View

Date Issued:
2013
Summary:
In this dissertation, we study some open problems concerning the existence or non-existence of some combinatorial designs. We give the construction or proof of non-existence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups.
Title: Construction of combinatorial designs with prescribed automorphism groups.
48 views
17 downloads
Name(s): Kolotoglu, Emre.
Charles E. Schmidt College of Science
Department of Mathematical Sciences
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Date Issued: 2013
Publisher: Florida Atlantic University
Physical Form: electronic
Extent: viii, 85 p. : ill.
Language(s): English
Summary: In this dissertation, we study some open problems concerning the existence or non-existence of some combinatorial designs. We give the construction or proof of non-existence of some Steiner systems, large sets of designs, and graph designs, with prescribed automorphism groups.
Identifier: 851183235 (oclc), 3360795 (digitool), FADT3360795 (IID), fau:4102 (fedora)
Note(s): by Emre Kolotoæglu.
Thesis (Ph.D.)--Florida Atlantic University, 2013.
Includes bibliography.
Mode of access: World Wide Web.
System requirements: Adobe Reader.
Subject(s): Combinatorial designs and configurations
Finite geometries
Curves, Algebraic
Automorphisms
Mathematical optimization
Steiner systems
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/3360795
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Owner Institution: FAU