Related papers: On primitive elements in finite fields of low char…

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 $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed…

For $q$ an odd prime power, we prove that there are always four consecutive primitive elements in the finite field $\mathbb{F}_{q}$ when $q> 2401$.

Let $r,n>1$ be integers and $q$ be any prime power $q$ such that $r\mid q^n-1$. We say that the extension $\mathbb{F}_{q^n}/\mathbb{F}_q$ possesses the line property for $r$-primitive elements property if, for every…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Given a prime power $q$ and an integer $n\geq2$, we establish a sufficient condition for the existence of a primitive pair $(\alpha,f(\alpha))$ where $\alpha \in \mathbb{F}_q$ and $f(x) \in \mathbb{F}_q(x)$ is a rational function of degree…

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…

We show that there are only finitely many finite fields whose members are the sum of an $n$-potent element and a $5$-potent element. Combining this with the algorithmic results provided by S.D. Cohen {\it et al.}, we confirm in the…

Given $\mathbb{F}_{q^{n}}$, a field with $q^n$ elements, where $q $ is a prime power and $n$ is positive integer. For $r_1,r_2,m_1,m_2 \in \mathbb{N}$, $k_1,k_2 \in \mathbb{N}\cup \{0\}$, a rational function $F = \frac{F_1}{F_2}$ in…

We give necessary and sufficient conditions for a polynomial of the form x^r*(1+x^v+x^(2v)+...+x^(kv))^t to permute the elements of the finite field GF(q). Our results yield especially simple criteria in case (q-1)/gcd(q-1,v) is a small…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

Building upon the author's previous work on primitivity testing of finite nilpotent linear groups over fields of characteristic zero, we describe precisely those finite nilpotent groups which arise as primitive linear groups over a given…

For polynomials of degree two over finite fields, we present an improvement of Fitzgerald's characterization (Finite Fields Appl. 9(1):117-121, 2003). We then use this new characterization to obtain an explicit, complete, and simple…

We classify those finite fields $\mathbb{F}_q$, for $q$ a power of some fixed prime number, whose members are the sum of an $n$-potent element with $n>1$ and a 4-potent element. It is shown that there are precisely ten non-trivial pairs…

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…

In this paper, we study several topics on additive decompositions of primitive elemements in finite fields. Also we refine some bounds obtained by Dartyge and S\'{a}rk\"{o}zy and Shparlinski.