Related papers: High Order Elements in Finite Fields Arising from …

The $p$-group generation algorithm is used to verify that the Hilbert $3$-class field tower has length $3$ for certain imaginary quadratic fields $K$ with $3$-class group $\mathrm{Cl}_3(K) \cong [3,3]$. Our results provide the first…

After extending the classic notion of a tight Heffter array H$(m,n)$ to any group of order $2mn+1$, we give direct constructions for elementary abelian tight Heffter arrays, hence in particular for prime tight Heffter arrays. If $q=2mn+1$…

Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such…

We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

We propose a superfast method for constructing orthogonal matrices $M\in\mathcal{O}(n,q)$ in finite fields $GF(q)$. It can be used to construct $n\times n$ orthogonal matrices in $Z_p$ with very high values of $n$ and $p$, and also…

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…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element 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…

Recently Bassa, Garcia and Stichtenoth constructed a tower of function fields over GF(q^3) having many rational places relative to their genera. We show that, by removing the bottom field from this tower, we obtain the same tower we would…

We construct an infinite family of imaginary quadratic number fields with 2-class groups of type (2,2,2) whose Hilbert 2-class fields are finite.

Let $U_n(q)$ be the upper triangular group of degree $n$ over the finite field $\F_q$ with $q$ elements. In this paper, we present constructions of large degree ordinary irreducible representations of $U_n(q)$ where $n\geq 7$, and then…

Cyclic number fields of odd prime degree are constructed as ray class fields over the rational number field. They are collected in multiplets sharing a common conductor and discriminant. The algorithms are implemented in Magma and applied…

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers…

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…

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…