Bazzi–Mitter conjecture on hyperelliptic-curve point bounds

From papers

For an odd prime pp and each non-empty subset SGF(p)S\subset GF(p), let XSX_S be the hyperelliptic curve defined by

y2=fS(x),fS(x)=aS(xa).y^2=f_S(x),\qquad f_S(x)=\prod_{a\in S}(x-a).

Write B(c,p)B(c,p) for the assertion that XS(GF(p))cp|X_S(GF(p))|\leq c\,p for every subset SGF(p)S\subset GF(p). Bazzi–Mitter conjecture. There is a c(0,2)c\in(0,2) such that B(c,p)B(c,p) holds for infinitely many primes pp. This conjecture seeks a uniform improvement over the trivial bound B(2,p)B(2,p) and is connected in the source to constructing binary codes with positive relative distance; the source gives no resolution.

Progress summary

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

Sources & referencesView supporting material

Primary source

David Joyner, “On quadratic residue codes and hyperelliptic curves”, arXiv:math/0609562 (2008).

Solutions 0

No solutions have been posted yet.