Related papers: On permutation quadrinomials from Niho exponents i…

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

A cyclotomic polynomial Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Eli…

Let $f={\tt X}^r(a+{\tt X}^{2(q-1)})\in{\Bbb F}_{q^2}[{\tt X}]$, where $a\in{\Bbb F}_{q^2}^*$ and $r\ge 1$. The parameters $(q,r,a)$ for which $f$ is a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ have been determined in the following…

The paper deals with the problem under which conditions for the parameters $s_1,s_2\in\mathbb{R}$, $1\leq p,q_1,q_2\leq\infty$ the Fourier transform $\mathcal{F}$ is a nuclear mapping from $A^{s_1}_{p,q_1}(\mathbb{R}^n)$ into…

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others. Recently, several authors have studied permutation…

Assume $n=2m\geq 2$ and let $F(x)=x^{d_1}+x^{d_2}$ be a binomial vectorial function over $\F_{2^n}$ possessing the maximal number (i.e. $2^n-2^m$) of bent components. Suppose the $2$-adic Hamming weights $\wt_2(d_1)$ and $\wt_2(d_2)$ are…

We propose and prove a trinomial version of the celebrated Bailey's lemma. As an application we obtain new fermionic representations for characters of some unitary as well as nonunitary models of N = 2 superconformal field theory (SCFT). We…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

For each prime power q, we determine all polynomials over F_{q^2} of the form f(X) := aX^{3q}+bX^{2q+1}+cX^{q+2}+dX^3 which induce complete mappings of F_{q^2}, in the sense that each of the functions x --> f(x) and x --> f(x)+x permutes…

Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $\mu_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and…

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

In this paper, we construct two classes of permutation polynomials over $\mathbb{F}_{q^2}$ with odd characteristic from rational R\'{e}dei functions. A complete characterization of their compositional inverses is also given. These…

We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where $e\geq 2$ and $a\in \mathbb{F}_{q^e}^*$. As a consequence, we obtain a complete characterization of such permutation…

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 prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

Planar functions are of great importance in the constructions of DES-like iterated ciphers, error-correcting codes, signal sets and the area of mathematics. They are defined over finite fields of odd characteristic originally and…

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…