ﻻ يوجد ملخص باللغة العربية
Let $mathbb{F}_q$ be the finite field of $q=p^mequiv 1pmod 4$ elements with $p$ being an odd prime and $m$ being a positive integer. For $c, y inmathbb{F}_q$ with $yinmathbb{F}_q^*$ non-quartic, let $N_n(c)$ and $M_n(y)$ be the numbers of zeros of $x_1^4+...+x_n^4=c$ and $x_1^4+...+x_{n-1}^4+yx_n^4=0$, respectively. In 1979, Myerson used Gauss sum and exponential sum to show that the generating function $sum_{n=1}^{infty}N_n(0)x^n$ is a rational function in $x$ and presented its explicit expression. In this paper, we make use of the cyclotomic theory and exponential sums to show that the generating functions $sum_{n=1}^{infty}N_n(c)x^n$ and $sum_{n=1}^{infty}M_{n+1}(y)x^n$ are rational functions in $x$. We also obtain the explicit expressions of these generating functions. Our result extends Myersons theorem gotten in 1979.
Let ${mathbb F}_q$ be the finite field with $q=p^k$ elements with $p$ being a prime and $k$ be a positive integer. For any $y, zinmathbb{F}_q$, let $N_s(z)$ and $T_s(y)$ denote the numbers of zeros of $x_1^{3}+cdots+x_s^3=z$ and $x_1^3+cdots+x_{s-1}^
Let $p$ be a prime, $k$ a positive integer and let $mathbb{F}_q$ be the finite field of $q=p^k$ elements. Let $f(x)$ be a polynomial over $mathbb F_q$ and $ainmathbb F_q$. We denote by $N_{s}(f,a)$ the number of zeros of $f(x_1)+cdots+f(x_s)=a$. In t
A variant of Brauers induction method is developed. It is shown that quartic p-adic forms with at least 9127 variables have non-trivial zeros, for every p. For odd p considerably fewer variables are needed. There are also subsidiary new results concerning quintic forms, and systems of forms.
Numerical ranges over a certain family of finite fields were classified in 2016 by a team including our fifth author. Soon afterward, in 2017 Ballico generalized these results to all finite fields and published some new results about the cardinality
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds on multipl