The modified prime sieve for primitive elements in finite fields

Abstract

Let r ≥ 2 be an integer, q a prime power and Fq the finite field with q elements. Consider the problem of showing existence of primitive elements in a subset A ⊂eq Fqr. We prove a sieve criterion for existence of such elements, dependent only on an estimate for the character sum Σγ ∈ A(γ). The flexibility and direct applicability of our criterion should be of considerable interest for problems in this field. We demonstrate the utility of our result by tackling a problem of Fernandes and Reis (2021) with A avoiding affine hyperplanes, obtaining significant improvements over previous knowledge.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…