✦ LIBER ✦

Reversible and DRAD difference sets in

✍ Scribed by Jordan D. Webster

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 119 KB
Volume: 20
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20305

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The existence of Hadamard difference sets has been a central question in design theory. Reversible difference sets have been studied extensively. Dillon gave a method for finding reversible difference sets in groups of the form (C)^2^. DRAD difference sets are a newer concept. Davis and Polhill showed the existence of DRAD difference sets in the same groups as Dillon. This article determines the existence of reversible and DRAD difference sets in groups of the form (C)^3^. These are the only abelian 2‐groups outside of direct products of C~4~ and (C)^2^ known to contain reversible and DRAD difference sets. © 2011 Wiley Periodicals, Inc. J Combin Designs 20:58–67, 2012

📜 SIMILAR VOLUMES

Difference Sets and Recursion Theory

✍ James H. Schmerl 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 411 KB

recursively enumerable set but which is not the difference set of any recursive set.

An extension of building sets and relati

An extension of building sets and relative difference sets

✍ Xiang-dong Hou; Surinder K. Sehgal 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Building sets are a successful tool for constructing semi-regular divisible difference sets and, in particular, semi-regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi-regular relative difference sets obtained

On the Existence of Abelian Hadamard Dif

On the Existence of Abelian Hadamard Difference Sets and a New Family of Difference Sets

✍ Yu Qing Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Looking for difference sets in D2p × Zq

✍ Emily H. Moore; Amanda Walker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

We consider groups D 2p Â Z q , with p and q odd primes, q `p, and for which each prime dividing n has order p À 1 (mod p). If such a group contains a nontrivial difference set, D, our main theorem gives constraints on the parameters of D. This in turn rules out difference sets in some groups of thi

New partial difference sets in p-groups

✍ Xiang-Dong Hou 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract Latin square type partial difference sets (PDS) are known to exist in __R__ × __R__ for various abelian __p__‐groups __R__ and in ℤ^__t__^. We construct a family of Latin square type PDS in ℤ^__t__^ × ℤ^2__nt__^~__p__~ using finite commutative chain rings. When __t__ is odd, the ambient

Exponential number of inequivalent diffe

Exponential number of inequivalent difference sets in ℤ

✍ James A. Davis; Deirdre L. Smeltzer 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract Kantor [5] proved an exponential lower bound on the number of pairwise inequivalent difference sets in the elementary abelian group of order 2^2s+2^. Dillon [3] generalized a technique of McFarland [6] to provide a framework for determining the number of inequivalent difference sets in