Related papers: Elements of high order in finite fields specified …

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

It is known that infinitely many number fields and function fields of any degree $m$ have class number divisible by a given integer $n$. However, significantly less is known about the indivisibility of class numbers of such fields. While…

Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those…

For a fixed quadratic irreducible polynomial $f$ with no fixed prime factors at prime arguments, we prove that there exist infinitely many primes $p$ such that $f(p)$ has at most 4 prime factors, improving a classical result of Richert who…

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

Let $\mathbb{F}_q$ denote the finite field of $q$ elements with characteristic $p$. Let $\mathbb{Z}_q$ denote the unramified extension of the $p$-adic integers $\mathbb{Z}_p$ with residue field $\mathbb{F}_q$. In this paper, we investigate…

Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…

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…

We suggest a construction of the minimal polynomial $m_{\beta^k}$ of $\beta^k\in \mathbb F_{q^n}$ over $\mathbb F_q$ from the minimal polynomial $f= m_\beta$ for all positive integers $k$ whose prime factors divide $q-1$. The computations…

Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements…

Let $G$ be a finite group and let $p_1,\dots,p_n$ be distinct primes. If $G$ contains an element of order $p_1\cdots p_n,$ then there is an element in $G$ which is not contained in the Frattini subgroup of $G$ and whose order is divisible…

Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\varepsilon_q d-1)/(p-1)$, where…

An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications such as cryptography and coding theory. As far as we know,…

We give an exact formula, as a function of m and q, for the maximum order of the elements of the finite symplectic group Sp(2m,q), with q even, and of its automorphism group.

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

We show that a large multiplicative subgroup of a finite field $\mathbb{F}_q$ cannot be decomposed into $A+A$ or $A+B+C$ nontrivially. We also find new families of multiplicative subgroups that cannot be decomposed as the sum of two sets…

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…

Let $p$ be a prime. For $p=2$, the fields of values of the complex irreducible characters of finite groups whose degrees are not divisible by $p$ have been classified; for odd primes $p$, a conjectural classification has been proposed. In…

We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…