Ding's conjectured difference sets from x(x+1) polynomials

About 11 years old · traced to

Let m≥4m\geq 4 and, for f∈GF⁡(2m)[x]f\in\operatorname{GF}(2^m)[x], define

Df={f(x(x+1)):x∈GF⁡(2m)}∖{0}.D_f=\{f(x(x+1)):x\in\operatorname{GF}(2^m)\}\setminus\{0\}.

Ding's second difference-set conjecture. For the following three polynomials, with the indicated parity conditions,

f(x)=x+x2(m+1)/2−1+x2m−2(m+1)/2+1(m odd),f(x)=x+x^{2^{(m+1)/2}-1}+x^{2^m-2^{(m+1)/2}+1}\quad(m\text{ odd}), f(x)=x+x(2m+1)/3+x(2m+1−1)/3(m odd),f(x)=x+x^{(2^m+1)/3}+x^{(2^{m+1}-1)/3}\quad(m\text{ odd}), f(x)=x+x2(m+2)/2−1+x2m−2m/2+1(m even),f(x)=x+x^{2^{(m+2)/2}-1}+x^{2^m-2^{m/2}+1}\quad(m\text{ even}),

DfD_f is a difference set in (GF⁡(2m)∗,×)(\operatorname{GF}(2^m)^*,\times) with Singer parameters

(2m−1, 2m−1−1, 2m−2−1).(2^m-1,\,2^{m-1}-1,\,2^{m-2}-1).

The claim is another list of conjectured cyclic difference sets attributed in the source to Chapter 4 of Ding's book.

References

Primary source

Cunsheng Ding, “Linear Codes from Some 2-Designs”, arXiv:1503.06511 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.