Local permutation polynomials and the action of e-Klenian groups

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new construction of MOLS on size a prime power.     

Cyclotomy and permutation polynomials of large indices

We use cyclotomy to construct new classes of permutation polynomials over finite fields. This allows us to generate permutation polynomials in an algorithmic way and also to unify several previous constructions. Many permutation polynomials constructed in this way have large indices.     

A note on inverses of cyclotomic mapping permutation polynomials over finite fields

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation polynomials that are involutions. Our results provide a fast algorithm (only modular operations are involved) to generate many classes of generalized cyclotomic permutation polynomials, their inverses, and involutions.     

On inverses of some permutation polynomials over finite fields of characteristic three

By using the piecewise method, Lagrange interpolation formula and Lucas' theorem, we determine explicit expressions of the inverses of a class of reversed Dickson permutation polynomials and some classes of generalized cyclotomic mapping permutation polynomials over finite fields of characteristic three.     

On factorization of polynomials in henselian valued fields

Guàrdia, Montes and Nart generalized the well-known method of Ore to find complete factorization of polynomials with coe?cients in finite extensions of p-adic numbers using Newton polygons of higher order (cf. [Trans. Amer. Math. Soc. 364 (2012), 361–416]). In this paper, we develop the theory of higher order Newton polygons for polynomials with coe?cients in henselian valued fields of arbitrary rank and use it to obtain factorization of such polynomials. Our approach is different from the one followed by Guàrdia et al. Some preliminary results needed for proving the main results are also obtained which are of independent interest.     

On a conjecture about a class of permutation quadrinomials

Very recently, Tu et al. presented a sufficient condition on $(a_1,a_2,a_3)$, see Theorem 1.1, such that $f(x)=x^{3\cdot 2^m}+a_1{x}^{2^{m+1}+1}+a_2{x}^{2^m+2}+a_3{x}^3$ is a class of permutation polynomials over ${\mathbb{F}}_{2^n}$ with $n=2m$ and m odd. In this present paper, we prove that the sufficient condition is also necessary.     

Ambiguity,deficiency and differential spectrum of normalized permutation polynomials over finite fields

We obtain exact formulas for the differential spectrum, deficiency and ambiguity of all normalized permutation polynomials of degree up to six over finite fields.     

有限域上与仿射多项式有关的一些多项式的可约性

在这篇文章中,研究了有限域上一些与仿射多项式有关的多项式的可约性.对于有限域Fp上不是xppt-x-1的仿射三项式,得到了这些三项式的一个明确的因式.完全确定了多项式g(xps-ax-b)在Fp[x]中的分解,这里g(x)是Fp[x]中一个不可约多项式.证明了Fp上次数相同的不可约多项式的全体可以构成一个正则图.同时给出了多项式g(xqs-x-b)在Fp[x]不可约因式的个数公式,这里g(x)是Fp上一个不可约多项式.