Related papers: Counting solutions of special linear equations ove…
Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…
Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…
In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i \in Q in groups F_2^n is…
For a prime power $q$, we study the distribution of determinent of matrices with restricted entries over a finite field $\mathbbm{F}_q$ of $q$ elements. More precisely, let $N_d (\mathcal{A}; t)$ be the number of $d \times d$ matrices with…
In this paper, with the help of the theory of matrices and finite fields we generalize Zolotarev's theorem to an arbitrary finite dimensional vector space over $\mathbb{F}_q$, where $\mathbb{F}_q$ denotes the finite field with $q$ elements.
Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…
We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…
Let $l$ and $k$ be two integers such that $l|k$. Define $T_l^k(X):=X+X^{p^l}+\cdots+X^{p^{l(k/l-2)}}+X^{p^{l(k/l-1)}}$ and $S_l^k(X):=X-X^{p^l}+\cdots+(-1)^{(k/l-1)}X^{p^{l(k/l-1)}}$, where $p$ is any prime. This paper gives explicit…
We give a complete conjectural formula for the number $e_r(d,m)$ of maximum possible ${\mathbb{F}}q$-rational points on a projective algebraic variety defined by $r$ linearly independent homogeneous polynomial equations of degree $d$ in…
Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…
In the first two papers, the author embarked on a study of classes of linear equations over integers satisfying a "Farkas-type" property. As the third paper in this study, the present paper deals with another class of linear equations over…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the…
Given a prime power $q$ and a positive integer $n$, let $\mathbb{F}_{q^{n}}$ represents a finite extension of degree $n$ of the finite field ${\mathbb{F}_{q}}$. In this article, we investigate the existence of $m$ elements in arithmetic…
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 $a\in\mathbb F_q$. We denote by $N_{s}(f,a)$ the number of zeros of…
The existence and multiplicity of positive periodic solutions for first non-autonomous singular systems are established with superlinearity or sublinearity assumptions at infinity for an appropriately chosen parameter. The proof of our…
For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…
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…
Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…
A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…