Related papers: Permutation polynomials of the form $x+\gamma \mat…

We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing…

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

Hughes introduced the projective planes that bear his name in 1957 and they have since been studied extensively. However, until now, no polynomial representation of a planar ternary ring that represents them has been determined. In this…

Cohn and Kumar showed the quadratic character of $q$ modulo $p$ gives the sign of the permutation of Hurwitz primes of norm $p$ induced by the Hurwitz primes of norm $q$ under metacommutation. We demonstrate that these permutations are…

We provide combinatorial interpretation for the $\gamma$-coefficients of the basic Eulerian polynomials that enumerate permutations by the excedance statistic and the major index as well as the corresponding $\gamma$-coefficients for…

The periods of polynomials can be used to characterize discrete structures such as algebraic error control codes and feedback shift registers. We study trinomial $x^h+x+1$ over GF(2), which has the maximum number of consecutive zero…

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

A family $f_t(z)$ of polynomials over a number field $K$ will be called \emph{weighted homogeneous} if and only if $f_t(z)=F(z^e, t)$ for some binary homogeneous form $F(X, Y)$ and some integer $e\geq 2$. For example, the family $z^d+t$ is…

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…

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

Using arbitrary bases for the finite field $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$, we obtain the generalized M\"obius transformations (GMTs), which are a class of bijections between the projective geometry $PG(n-1,q)$ and the set of roots…

Let $\mathbb{K}$ be the algebraic closure of a finite field $\mathbb{F}_q$ of odd characteristic $p$. For a positive integer $m$ prime to $p$, let $F=\mathbb{K}(x,y)$ be the transcendency degree $1$ function field defined by…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We study polynomials in $x$ and $y$ of degree $n+m:\allowbreak \{Q_{m,n}(x,y|t,q)\}_{n,m\geq 0}$ that appeared recently in the following identity: $\gamma_{m,n}(x,y|t,q) \allowbreak =\allowbreak \gamma_{0,0}(x,y|t,q) \allowbreak…

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Let $F$ be an infinite field, and let $M_{n}(F)$ be the algebra of $n\times n$ matrices over $F$. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we…

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then…

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…