A survey of the multiplier conjecture (Q908048): Difference between revisions

A \((v,k,\lambda,n)\) difference set in an abelian group \(G\) of order \(v\) is a \(k\)-subset \(D\) of \(G\) such that every element \(g\neq 1\) of \(G\) has exactly \(\lambda\) representations \(g=d_1d_2^{-1}\) with \(d_1,d_2 \in D\). By replacing \(D\) by \(G \setminus D\) if necessary, we may assume \(1 < k < v/2\). The positive integer \(n=k-\lambda\) is called the order of the difference set. An integer \(t\) is a multiplier of \(D\) if \(\{d^t: d\in D\} =\{dg : d \in G\}\) for some \(g\in G\). In this paper, the authors ``review the current status of the multiplier conjecture for difference sets, present some new results on it, and determine the open cases of the conjecture for abelian groups of order \(< 10^6\). It turns out that for Paley parameters \((4n-1,2n-1,n-1,n)\), where \(4n-1\) is a prime power, the validity of the multiplier conjecture can be verified in the vast majority of cases, while for other parameter sets numerous cases remain open.''