Counting roots of fully triangular polynomials over finite fields
Abstract
Let Fq be a finite field with q elements, f ∈ Fq[x1, …, xn] a polynomial in n variables and let us denote by N(f) the number of roots of f in Fqn. %Many authors, such as Wei Cao and Kung Jiang have used augmented degree matrices to determine N(f) for different families of polynomials. In this paper we consider the family of fully triangular polynomials, i.e., polynomials of the form equation* f(x1, …, xn) = a1 x1d1,1 + a2 x1d1,2 x2d2,2 + … + an x1d1,n·s xndn,n - b, equation* where di,j > 0 for all 1 i j n. For these polynomials, we obtain explicit formulas for N(f) when the augmented degree matrix of f is row-equivalent to the augmented degree matrix of a linear polynomial or a quadratic diagonal polynomial.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.