scientific article; zbMATH DE number 3983174

From MaRDI portal
Publication:3748288





Let \(G\) be a group of order v. Suppose that the group operation of \(G\) is multiplication. A set \(D=\{g_ 1,g_ 2,...,g_ k\}\) of distinct elements of \(G\) is called a \((v,k,\lambda)\) difference set of \(G\) if every non-identity element \(g\) in \(G\) can be expressed as \(g=g_ ig_ j^{-1}\) in exactly \(\lambda\) distinct ways. The following results are proved: (1) There is no nontrivial \((2n,k,\lambda)\) difference set in the dihedral group \(D_ n\) if g.c.d. \((n,k-\lambda)=1.\) (2) If there is a nontrivial (2n,k,\(\lambda)\) difference set in \(D_ n\), then there is a nontrivial \((2n,k,\lambda)\) difference set in the cyclic group \(C_{2n}.\) The authors believe that there is no nontrivial difference set in \(D_ n\). (A result of \textit{R. J. Turyn} [Character sums and difference sets, Pac. J. Math. 15, 319-346 (1965; Zbl 0135.05403)] confirms this for \(n=2^ r\) and the present authors also prove this for \(n=p^ r\), p an odd prime.)











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3748288)