Kloosterman sums are exponential sums over finite fields that appear throughout number theory, cryptography, and coding theory. The classical result — Weil’s bound — gives a square-root estimate for their magnitude. This is optimal and enormously useful: it says these oscillating sums cancel almost as well as random sums would.

The challenge is extending this to non-commutative settings. Finite semisimple algebras over finite fields generalize the commutative case (finite étale algebras), and the question becomes: does the square-root cancellation survive when the algebra is non-commutative?

The author shows that it does. An asymptotic formula with a square-root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra. The key tools are the Eichler formula for Gauss sums over the general linear group and the Hasse-Davenport relation, which reduce the non-commutative problem to the already-solved geometric case. The Kloosterman sum estimates follow as a consequence.

The structural point: non-commutativity could destroy cancellation. When elements don’t commute, the exponential sum could accumulate rather than cancel — the phase coherence that produces square-root bounds in the commutative case might break. It doesn’t, because the reduction via Gauss sums and Hasse-Davenport preserves the essential structure. The cancellation mechanism is more robust than the commutativity that seems to underlie it.

(arXiv:2603.18511)