Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Discrete Mathematics and Combinatorics
Almost Difference Sets And Reversible Divisible Difference Sets, James A. Davis
Almost Difference Sets And Reversible Divisible Difference Sets, James A. Davis
Department of Math & Statistics Faculty Publications
Let G be a group of order mn and N a subgroup of G of order n. If D is a k-subset of G, then D is called a (m, n, k, λ1, λ2) divisible difference set (DDS) provided that the differences dd'-1 for d, d' ∈ D, d ≠ d' contain every nonidentity element of N exactly λ1 times and every element of G - N exactly λ2 times. Difference sets are used to generate designs, as described by [4] and [9]. D will be …
A Note On Nonabelian (64, 28, 12) Difference Sets, James A. Davis
A Note On Nonabelian (64, 28, 12) Difference Sets, James A. Davis
Department of Math & Statistics Faculty Publications
The existence of difference sets in abelian 2-groups is a recently settled problem [5]; this note extends the abelian constructs of difference sets to nonabelian groups of order 64.