Related papers: Large classes of permutation polynomials over $\ma…
Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…
An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $\theta:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$,…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…
In this paper, we connect two types of representations of a permutation $\sigma$ of the finite field $\F_q$. One type is algebraic, in which the permutation is represented as the composition of degree-one polynomials and $k$ copies of…
We study Jacobi pairs in details and obtained some properties. We also study the natural Poisson algebra structure $(\PP,[...,...],...)$ on the space $\PP:=\C[y]((x^{-\frac1N}))$ for some sufficient large $N$, and introduce some…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
Let $k$ be a positive integer and $S_{2k}={\tt x}+{\tt x}^4+...+{\tt x}^{4^{2k-1}}\in\Bbb F_2[{\tt x}]$. It was recently conjectured that ${\tt x}+S_{2k}^{4^{2k}}+S_{2k}^{4^k+3}$ is a permutation polynomial of $\Bbb F_{4^{3k}}$. In this…
We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$…
The idea of this review article is to discuss in a unified way the orthogonality of all positive definite polynomial solutions of the $q$-hypergeometric difference equation on the $q$-linear lattice by means of a qualitative analysis of the…
We determine which quadratic polynomials in three variables are expanders over an arbitrary field $\mathbb{F}$. More precisely, we prove that for a quadratic polynomial $f\in \mathbb{F}[x,y,z]$, which is not of the form $g(h(x)+k(y)+l(z))$,…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…
$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
We determine all permutation trinomials of type $x^{2p^s+r}+x^{p^s+r}+\lambda x^r$ over the finite field $\mathbb{F}_{p^t}$ when $(2p^s+r)^4<p^t$. This partially extends a previous result by Bhattacharya and Sarkar in the case $p=2$, $r=1$.
Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…