Papers
Topics
Authors
Recent
Search
2000 character limit reached

Counting roots of fully triangular polynomials over finite fields

Published 2 Aug 2023 in math.NT | (2308.01435v2)

Abstract: Let $\mathbb{F}q$ be a finite field with $q$ elements, $f \in \mathbb{F}_q[x_1, \dots, x_n]$ a polynomial in $n$ variables and let us denote by $N(f)$ the number of roots of $f$ in $\mathbb{F}_qn$. %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 \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 $d_{i,j} > 0$ for all $1 \le i \le j \le 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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.