Looking for Difference Sets in Groups with Dihedral Images

We prove four theorems about groups with a dihedral (or cyclic) image containing a difference set. For the first two, suppose G, a group of order 2p with p an odd prime, contains a nontrivial (v, k, ) difference set D with order n = k – prime to p and self-conjugate modulo p. If G has an image of order p, then 0 2a + 2 for a unique choice of = ±1, and for a = (k – )/2p. If G has an image of order 2p, then and ( – 1)/( – 1). There are further constraints on n, a and . We give examples in which these theorems imply no difference set can exist in a group of a specified order, including filling in some entries in Smith's extension to nonabelian groups of Lander's tables. A similar theorem covers the case when p|n. Finally, we show that if G contains a nontrivial (v, k, ) difference set D and has a dihedral image D _2m with either (n, m) = 1 or m = p ^t for p an odd prime dividing n, then one of the C ₂ intersection numbers of D is divisible by m. Again, this gives some non-existence results.