Proof of a Conjectured Three-Valued Family of Weil Sums of Binomials

preprint2015arXivOpen access

Abstract

We consider Weil sums of binomials of the form WF,d(a)=∑x∈Fψ(xd−ax)W_{F,d}(a)=\sum_{x \in F} ψ(x^d-a x), where FF is a finite field, ψ ⁣:F→Cψ\colon F\to {\mathbb C} is the canonical additive character, gcd⁡(d,∣F×∣)=1\gcd(d,|F^\times|)=1, and a∈F×a \in F^\times. If we fix FF and dd and examine the values of WF,d(a)W_{F,d}(a) as aa runs through F×F^\times, we always obtain at least three distinct values unless dd is degenerate (a power of the characteristic of FF modulo ∣F×∣|F^\times|). Choices of FF and dd for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if FF is a field of order 3n3^n with nn odd, and d=3r+2d=3^r+2 with 4r≡1(modn)4 r \equiv 1 \pmod{n}, then WF,d(a)W_{F,d}(a) assumes only the three values 00 and ±3(n+1)/2\pm 3^{(n+1)/2}. This proves the 2001 conjecture of Dobbertin, Helleseth, Kumar, and Martinsen. The proof employs diverse methods involving trilinear forms, counting points on curves via multiplicative character sums, divisibility properties of Gauss sums, and graph theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.