Multiplicative character sums over two classes of subsets of quadratic extensions of finite fields
Abstract
Let q be a prime power and r a positive even integer. Let Fq be the finite field with q elements and Fqr be its extension field of degree r. Let be a nontrivial multiplicative character of Fqr and f(X) a polynomial over Fqr with a simple root in Fqr. In this paper, we improve estimates for character sums Σg ∈G(f(g)), where G is either a subset of Fqr of sparse elements, with respect to some fixed basis of Fqr which contains a basis of Fqr/2, or a subset avoiding affine hyperplanes in general position. While such sums have been previously studied, our approach yields sharper bounds by reducing them to sums over the subfield Fqr/2 rather than sums over general linear spaces. These estimates can be used to prove the existence of primitive elements in G in the standard way.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.