English

Counting roots of fully triangular polynomials over finite fields

Number Theory 2023-12-08 v2

Abstract

Let Fq\mathbb{F}_q be a finite field with qq elements, fFq[x1,,xn]f \in \mathbb{F}_q[x_1, \dots, x_n] a polynomial in nn variables and let us denote by N(f)N(f) the number of roots of ff in Fqn\mathbb{F}_q^n. %Many authors, such as Wei Cao and Kung Jiang have used augmented degree matrices to determine N(f)N(f) for different families of polynomials. In this paper we consider the family of fully triangular polynomials, i.e., polynomials of the form \begin{equation*} f(x_1, \dots, x_n) = a_1 x_1^{d_{1,1}} + a_2 x_1^{d_{1,2}} x_2^{d_{2,2}} + \dots + a_n x_1^{d_{1,n}}\cdots x_n^{d_{n,n}} - b, \end{equation*} where di,j>0d_{i,j} > 0 for all 1ijn1 \le i \le j \le n. For these polynomials, we obtain explicit formulas for N(f)N(f) when the augmented degree matrix of ff is row-equivalent to the augmented degree matrix of a linear polynomial or a quadratic diagonal polynomial.

Keywords

Cite

@article{arxiv.2308.01435,
  title  = {Counting roots of fully triangular polynomials over finite fields},
  author = {José Gustavo Coelho and Fabio Enrique Brochero Martínez},
  journal= {arXiv preprint arXiv:2308.01435},
  year   = {2023}
}
R2 v1 2026-06-28T11:46:51.427Z