Related papers: On diagonal equations over finite fields via walks…

Let $\mathbb{F}_q$ be a finite field with $q=p^t$ elements. In this paper, we study the number of solutions of equations of the form $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$ over $\mathbb{F}_q$. A classic well-konwn result from Weil yields a…

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

Let $p$ be a prime number, $m$ be an even positive integer, and $\mathbb{F}_q$ be a finite field with $q = p^m$ elements. In this paper, we compute the number of solutions with all coordinates in $\mathbb{F}_q^*$ for diagonal equations of…

Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of solutions of equations of the form $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$ with $x_i\in\mathbb{F}_{p^{t_i}}$, where $b\in\mathbb{F}_q$ and…

Let $\mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2, \ldots, a_k, b\in \mathbb{F}_q$. We investigate $N_{\mathbb{F}_q}(a_1, a_2, \ldots,a_k;b)$, the number of ordered solutions $(x_1, x_2, \ldots,x_k)\in\mathbb{F}_q^k$ of…

We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In…

In this paper, we introduce and develop the method of diagonalization of functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to show that the equations of the form $\Gamma_r(n)+k=m^2$ has a finite number of solutions…

Let $\mathbb{F}_q$ be a finite field of $q=p^k$ elements. For any $z\in \mathbb{F}_q$, let $A_n(z)$ and $B_n(z)$ denote the number of solutions of the equations $x_1^3+x_2^3+\cdots+x_n^3=z$ and $x_1^3+x_2^3+\cdots+x_n^3+zx_{n+1}^3=0$…

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

In this paper we obtain explicit estimates and existence results on the number of $\mathbb{F}_q$-rational solutions of certain systems defined by families of diagonal equations over finite fields. Our approach relies on the study of the…

We obtain asymptotic upper bounds for the number of natural solutions of the following diagonal Diophantine equations in a hypercube with side - $N$ in the paper: $x_1 = x_2^k+...+x_s^k$, $x_1^k = x_2^k+...+x_s^k$, $x_1 = \sum_{j=2}^s…

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the…

In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…

In this paper, we assume that $q>0$, $p>1$ and $s\in(0,1)$ , and consider the following nonlinear fractional p-Laplacian equations on finite graphs: \begin{equation*} \left\{ \begin{array}{lll} \partial_t u^q(x,t)+(-\Delta)_p^su=0,\\[15pt]…

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

The problem of solving explicitly the equation $P_a(X):=X^{q+1}+X+a=0$ over the finite field $\GF{Q}$, where $Q=p^n$, $q=p^k$ and $p$ is a prime, arises in many different contexts including finite geometry, the inverse Galois problem…

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…