A DETAILED FINITE-CARRY PROOF OF A CONJECTURE ON PERMUTATION BINOMIALS IN CHARACTERISTIC TWO

A mix of human-written and AI-generated textHuman understanding: all partsmath.NT — Number Theory

Contributed by yi li ↗

Version 1 / Nov 16, 2026 / CC BY 4.0

Abstract

Let q = 2m, where m ≥ 5 is odd and 3 | m. Tu, Zeng, Jiang and Li formulated a conjecture asserting that if a family of Hermite-type sums Sr,α(y), attached to the binomial xr(a+ x3(q−1)), vanishes for every α with 3 | (1 + α), then y3 = 1. We give a detailed proof, including all exceptional and boundary cases. In fact, seven indices suffice: α ∈ {2,8,14,20,26,32,38}. The first two indices reduce a hypothetical counterexample to a primitive seventh root of unity. Lucas’s theorem then turns the remaining equations into six-bit conditions, and an explicit finite carry elimination completes the proof. The paper records the complete residue tables, their derivation, and a short SageMath verification certificate.

References

  1. Z. Tu, X. Zeng, Y. Jiang and Y. Li, Binomial permutations over finite fields with even characteristic , Designs, Codes and Cryptography 89 (2021), 2869--2888, https://doi.org/10.1007/s10623-021-00959-4.DOI

Version history

  1. v1 · 11 pagesSubmitted by yi liInitial depositCurrentNov 16, 2026