Related papers: Small Primitive Normal Elements in Finite Fields

Let $q$ be a fixed odd prime. We show that a finite subset $B$ of integers, not containing any perfect $q^{th}$ power, contains a $q^{th}$ power modulo almost every prime if and only if $B$ corresponds to a blocking set (with respect to…

This is an introduction to the theory of normal bases of finite fields. The first few chapters cover a wide range of topics on the theory of normal bases of finite fields. Most standard definitions and results, including proofs are given.…

Let $r$ be a positive divisor of $q-1$ and $f(x,y)$ a rational function of degree sum $d$ over $\mathbb{F}_q$ with some restrictions, where the degree sum of a rational function $f(x,y) = f_1(x,y)/f_2(x,y)$ is the sum of the degrees of…

Let $F=\mathbb{F}_{q^m}$, $m>6$, $n$ a positive integer, and $f=p/q$ with $p$, $q$ co-prime irreducible polynomials in $F[x]$ and deg$(p)$ $+$ deg$(q)= n$. A sufficient condition has been obtained for the existence of primitive pairs…

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…

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$.…

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

Let $G$ be a transitive permutation group on a finite set of size at least $2$. By a well known theorem of Fein, Kantor and Schacher, $G$ contains a derangement of prime power order. In this paper, we study the finite primitive permutation…

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

This is an essay about a certain family of elements in the general linear group GL(d,q) called primitive prime divisor elements, or ppd-elements. A classification of the subgroups of GL(d,q) which contain such elements is discussed, and the…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

The notion of normal elements for finite fields extension has been generalized as k-normal elements by Huczynska et al. [3]. The number of k-normal elements for a fixed finite field extension has been calculated and estimated [3], and…

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

Let $\mathbb{F}$ be a finite field consisting of $q$ elements and let $n \geq 1$ be an integer. In this paper, we study the size of local Kakeya sets with respect to subsets of $\mathbb{F}^{n}$ and obtain upper and lower bounds for the…

In this note, we give an upper bound for the number of elements from the interval $[1,p^{1/4e^{1/2}+\epsilon}]$ necessary to generate the finite field $\mathbb{F}_{p}$ with $p$ an odd prime.

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that…

Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p*$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p*$. This algorithm is based on elementary properties of finite…

Let $\mathbb F_q$ be a finite field with $q$ elements, $G$ a finite cyclic group of order $p^k$ and $p$ is an odd prime with ${\rm gcd}(q,p)=1$. In this article, we determine an explicit expression for the primitive idempotents of $\mathbb…

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with…