The Welch function is not third-order sum-free

A mix of human-written and AI-generated textHuman understanding: some partsmath.NT — Number Theorycs.IT — Information Theory

Contributed by Deep Bhattacharjee

Version 2 / Oct 22, 2026 / CC BY 4.0

Abstract

Let n=2m+1n=2m+1 be odd and let $\F_{2^n}$ be the field with 2n2^n elements. A function on $\F_{2^n}$ is third-order sum-free when its values over any eight elements forming a three-dimensional affine subspace never add up to zero. The Welch function is the power map x↦x2m+3x\mapsto x^{2^m+3}; it is one of the classical almost perfect nonlinear functions, and Hou and Zhao conjectured that for n≥7n\ge7 it is not third-order sum-free. We prove this. The question comes down to a linearised polynomial g(x,y)g(x,y) in yy whose roots form a vector space Z(x)Z(x) over $\F_2$ containing 11 and xx, and the Welch function fails to be third-order sum-free exactly when Z(x)Z(x) has dimension three for some xx outside $\F_2$. We show that the dimension is always 22 or 33, and that it is 33 if and only if two explicit trace conditions hold: with u=x2mu=x^{2^m}, both $\Tr(1/(x+u))$ and $\Tr(xu/(x+u))$ equal 11. The proof applies the field automorphism z↦z2m+1z\mapsto z^{2^{m+1}}, whose square is the Frobenius map, to turn gg into an additive polynomial of degree eight whose roots always lie in $\F_{2^n}$. Counting the elements that satisfy both trace conditions gives exactly (2n+1−3Kn)/4(2^n+1-3K_n)/4 of them, where KnK_n is the binary Kloosterman sum of $\F_{2^n}$, and Weil's bound ∣Kn∣≤2n/2+1|K_n|\le 2^{n/2+1} makes this count positive for every n≥7n\ge7. The Welch function sums to zero over exactly (2n+1−3Kn)(2n−1)/168(2^n+1-3K_n)(2^n-1)/168 three-dimensional linear subspaces, and the count 2+(2n+1−3Kn)/42+(2^n+1-3K_n)/4 agrees with the numbers that Hou and Zhao computed for n≤15n\le15. Every statement is proved by hand.

Provenance statement

Deep Bhattacharjee chose the problem, Conjecture 4.10 of Hou and Zhao (arXiv:2609.31489), and directed the work. Claude (Anthropic), through Claude Code, searched the literature, found and checked the proofs, wrote the verification programs and drafted the paper. The results of this paper were first made public on 9 October 2026, as release \texttt{v1.0.0} of the repository \url{https://github.com/creelie/eConjectureWelchSumFree}; later versions (\texttt{v1.1.0} of 22 October and \texttt{v1.2.0} of 26 October) are archived on Zenodo as \href{https://doi.org/10.5281/zenodo.23553010}{10.5281/zenodo.23553010} and \href{https://doi.org/10.5281/zenodo.23662272}{10.5281/zenodo.23662272} (concept DOI \href{https://doi.org/10.5281/zenodo.23553009}{10.5281/zenodo.23553009}). An earlier and incomplete version of the paper appeared on Hexagon on 22 October 2026 as the preprint \texttt{hexagon:2610.00472}, available at \url{https://hexagonmath.org/2610.00472}. That version cited the conjecture and the corollary of Hou and Zhao as Conjecture~4.10 and Corollary~4.9, numbers that do not match their paper, listed the programs that check its statements in the text, and had a short abstract. This version is complete and self-contained: the references follow the arXiv paper of Hou and Zhao (Conjecture~5.10, Corollary~5.9, Section~5.3), every reference has been checked at its source, the abstract states what is proved, and every statement is proved by hand, so that no statement rests on a computer. The source of this revision is in release \texttt{v2.0.0} of the same repository, archived as \href{https://doi.org/10.5281/zenodo.23663217}{10.5281/zenodo.23663217}, with programs that recompute Table~\ref{tab} and check the criterion on small fields.

Tools used

Anthropic
Claude CodeVersion Fable 5.1 Medium

References

  1. D. Bhattacharjee, Establishing equivariant class [O][O] for hyperbolic groups, Asian Res. J. Math. 18 (2022), no. 11, 362--369. doi:10.9734/arjom/2022/v18i11615 (https://doi.org/10.9734/arjom/2022/v18i11615).DOI
  2. D. Bhattacharjee, Non-commutativity over canonical suspension η\eta for genus g≥1g\ge1 in hypercomplex structures for potential ρϕ\rho\phi, Asian Res. J. Math. 18 (2022), no. 11, 332--341. doi:10.9734/arjom/2022/v18i11607 (https://doi.org/10.9734/arjom/2022/v18i11607).DOI
  3. D. Bhattacharjee, U. Bhattacharya, Iterated nerve complexes for kk-fold sensor coverage, Preprints.org (2026). doi:10.20944/preprints202606.1351.v2 (https://doi.org/10.20944/preprints202606.1351.v2).DOI
  4. A. Canteaut, P. Charpin and H. Dobbertin, Binary mm-sequences with three-valued crosscorrelation: a proof of Welch's conjecture, IEEE Trans. Inform. Theory 46 (2000), no. 1, 4--8. doi:10.1109/18.817504 (https://doi.org/10.1109/18.817504).DOI
  5. C. Carlet, On the vector subspaces of $\F_{2^n}$ over which the multiplicative inverse function sums to zero, Des. Codes Cryptogr. 93 (2025), 1237--1254. doi:10.1007/s10623-024-01531-6 (https://doi.org/10.1007/s10623-024-01531-6).DOI
  6. C. Carlet, Two generalizations of almost perfect nonlinearity, J. Cryptology 38 (2025), no. 2, Paper No. 20. doi:10.1007/s00145-025-09538-5 (https://doi.org/10.1007/s00145-025-09538-5).DOI
  7. L. Carlitz, Kloosterman sums and finite field extensions, Acta Arith. 16 (1969), 179--194. doi:10.4064/aa-16-2-179-194 (https://doi.org/10.4064/aa-16-2-179-194).DOI
  8. H. Dobbertin, Almost perfect nonlinear power functions on GF(2n)GF(2^n): the Welch case, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1271--1275. doi:10.1109/18.761283 (https://doi.org/10.1109/18.761283).DOI
  9. X. Hou and S. Zhao, Further results on sum-freedom of binary and qq-ary functions, preprint, arXiv:2609.31489 (https://arxiv.org/abs/2609.31489) (2026).arXiv
  10. R. Lidl and H. Niederreiter, Finite Fields, 2nd ed., Encyclopedia Math. Appl. 20, Cambridge University Press, Cambridge, 1997. doi:10.1017/CBO9780511525926 (https://doi.org/10.1017/CBO9780511525926).DOI
Show all 11 referencesShow fewer references
  1. A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. U.S.A. 34 (1948), no. 5, 204--207. doi:10.1073/pnas.34.5.204 (https://doi.org/10.1073/pnas.34.5.204).DOI

Version history

  1. v1Submitted by Deep BhattacharjeeInitial depositSupersededOct 22, 2026
  2. v2Submitted by Deep BhattacharjeeSubmitted as a new versionCurrentOct 26, 2026