Related papers: High order elements in extensions of finite fields…

It is shown that a finite group in which more than 3/4 of the elements are involutions must be an elementary abelian 2-group. A group in which exactly 3/4 of the elements are involutions is characterized as the direct product of the…

We prove that every finitely-generated group of homeomorphisms of the 2-dimensional sphere all of whose elements have a finite order which is a power of 2 and so that there exists a uniform bound for the order of group elements is finite.…

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let $\{a_1,\ldots,a_r\}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

A Diophantine $m$-tuple over a finite field $\mathbb{F}_q$ is a set $\{a_1,\ldots, a_m\}$ of $m$ distinct elements in $\mathbb{F}_{q}^{*}$ such that $a_{i}a_{j}+1$ is a square in $\mathbb{F}_q$ whenever $i\neq j$. In this paper, we study…

Planar functions over finite fields give rise to finite projective planes and other combinatorial objects. They exist only in odd characteristic, but recently Zhou introduced an even characteristic analogue which has similar applications.…

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, communication…

Both the function and its normal derivative on the element boundary are $Q_k$ polynomials for the Bogner-Fox-Schmit $C^1$-$Q_k$ finite element functions. Mathematically, to keep the optimal order of approximation, their spaces are required…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

Let $\mathcal{S}_q$ denote the group of all square elements in the multiplicative group $\mathbb{F}_q^*$ of a finite field $\mathbb{F}_q$ of odd characteristic containing $q$ elements. Let $\mathcal{O}_q$ be the set of all odd order…

We give a completely normal element in the maximal real subfield of a cyclotomic field over the field of rational numbers, which is different from that of Okada. This result is a consequence of the criterion for a normal element developed…

Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots+X^{q^a-2}$ is a permutation polynomial of…

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

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$.

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

We provide both a general framework for discretizing de Rham sequences of differential forms of high regularity, and some examples of finite element spaces that fit in the framework. The general framework is an extension of the previously…