Difference sets with \(n=2p^m\) (Q1383823): Difference between revisions

Multipliers are a central tool in the investigation of abelian \((v,k,\lambda)\)-difference sets. It is sometimes conjectured that for all divisors \(t\) of the order \(n=k-\lambda\) with \(\gcd(t,v)=1\), the map \(x\to x^t\) is a multiplier. However, the proofs of most multiplier theorems require some technical conditions like \(n > \lambda\). The author shows that this condition, used in the proof of a multiplier theorem of \textit{H. B. Mann} and \textit{S. K. Zaremba} [Ill. J. Math. 13, 378-382 (1969; Zbl 0174.04203)], can be removed. As a corollary, \(p\) is a multiplier of any \((v,k,\lambda)\)-difference set of order \(2p^m\), where \(p\) is an odd prime not dividing \(v\). Muzychuk also improves a multiplier theorem of Weisheng for the case that the order \(n\) is divisible by 3. The proofs use the techniques developed in McFarland's thesis.