The Optimal Coefficients-Based Criterion for Primitive Quadratic Polynomials over Finite Fields
arXiv:2608.01327
Abstract
Let be a finite field and consider quadratic polynomials with primitive constant term . We construct an optimal coefficients-based determining polynomial for primitive quadratic polynomials over every finite field. More precisely, for every primitive , its specialization is the unique monic square-free polynomial whose roots are exactly the coefficients for which is primitive. The construction is based on Lucas polynomials and Lucas atoms over finite fields. In odd characteristic, the optimal determining polynomial is the -st Lucas atom. In characteristic , this Lucas atom has multiplicity in the variable , and the optimal polynomial is obtained by removing this multiplicity through the inverse Frobenius over . We prove that the determining polynomial is unique for each fixed primitive constant term and, globally, unique as an element of . We also give equivalent criteria involving only recursively computable Lucas polynomials and, as an application, a first-zero coefficient description of the binomial order and order of an irreducible quadratic polynomial.