Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Honors Theses

Difference sets

Articles 1 - 5 of 5

Full-Text Articles in Physical Sciences and Mathematics

Partitioning Groups With Difference Sets, Rebecca Funke Jan 2016

Partitioning Groups With Difference Sets, Rebecca Funke

Honors Theses

This thesis explores the use of difference sets to partition algebraic groups. Difference sets are a tool belonging to both group theory and combinatorics that provide symmetric properties that can be map into over mathematical fields such as design theory or coding theory. In my work, I will be taking algebraic groups and partitioning them into a subgroup and multiple McFarland difference sets. This partitioning can then be mapped to an association scheme. This bridge between difference sets and association schemes have important contributions to coding theory.


Cameron-Liebler Line Classes And Partial Difference Sets, Uthaipon Tantipongipat Jan 2016

Cameron-Liebler Line Classes And Partial Difference Sets, Uthaipon Tantipongipat

Honors Theses

The work consists of three parts. The first is a study of Cameron-Liebler line classes which receive much attention recently. We studied a new construction of infinite family of Cameron-Liebler line classes presented in the paper by Tao Feng, Koji Momihara, and Qing Xiang (rst introduced in 2014), and summarized our attempts to generalize this construction to discover any new Cameron-Liebler line classes or partial difference sets (PDSs) resulting from the Cameron-Liebler line classes. The second is our approach to finding PDS in non-elementary abelian groups. Our attempt eventually led to the same general construction of PDS presented in John …


Difference Sets In Non-Abelian Groups Of Order 256, Taylor Applebaum Apr 2013

Difference Sets In Non-Abelian Groups Of Order 256, Taylor Applebaum

Honors Theses

This paper considers the problem of determining which of the 56092 groups of order 256 contain (256; 120; 56; 64) difference sets. John Dillon at the National Security Agency communicated 724 groups which were still open as of August 2012. In this paper, we present a construction method for groups containing a normal subgroup isomorphic to Z4 Z4 Z2 . This construction method was able to produce difference sets in 643 of the 649 unsolved groups with the correct normal subgroup. These constructions elimated approximately 90% of the open cases, leaving 81 remaining unsolved groups.


On Some New Constructions Of Difference Sets, Sarah Agnes Spence May 1997

On Some New Constructions Of Difference Sets, Sarah Agnes Spence

Honors Theses

Difference sets are mathematical structures which arise in algebra and combinatorics, with applications in coding theory. The fundamental question is when and how one can construct difference sets. This largely expository paper looks at standard construction methods and describes recent findings that resulted in new families of difference sets. This paper provides explicit examples of difference sets that arise from the recent constructions. By gaining a thorough understanding of these new techniques, it may be possible to generalize the results to find additional new families of difference sets. The paper also introduces partial and relative difference sets and discusses how …


Symmetric Designs, Difference Sets, And A New Way To Look At Macfarland Difference Sets, John Bowen Polhill Jr. Apr 1993

Symmetric Designs, Difference Sets, And A New Way To Look At Macfarland Difference Sets, John Bowen Polhill Jr.

Honors Theses

In this paper, the topics of symmetric designs and difference sets are discussed both separately and in relation to each other. Then an approach to MacFarland Difference Sets using the theory behind homomorphisms from groups into the complex numbers is introduced. This method is contrasted with the method of finding this type of difference set used by E.S. Launder in his book Symmetric Designs: An Algebraic Approach.