A technique for constructing divisible difference sets

An (m, n, k, ₁,₂) divisible difference set in a groupG of ordermn relative to a subgroupN of ordern is ak-subsetD ofG such that the list {xy^–1:x, y D} contains exactly ₁ copies of each nonidentity element ofN and exactly ₂ copies of each element ofG N. It is called semi-regular ifk > ₁ and k²=mn₂. We develop a method for constructing a divisible difference set as a product of a difference set and a relative difference set or a difference set and a subset ofG which we call a relative divisible difference set. The method results in several parametrically new families of semi-regular divisible difference sets.