相关论文: A classification of permutation polynomials of deg…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…

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…

We prove that every finite dimensional representation of a finite group over a field of characteristic p admits a finite resolution by p-permutation modules. The proof involves a reformulation in terms of derived categories.

We give all splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$ and some splitting ones over $\mathbb{F}_{p^2}$, if $p$ is an odd prime.

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…

Let V be a d-dimensional vector space over a field of prime order p. We classify the affine transformations of V of order at least p^d/4, and apply this classification to determine the finite primitive permutation groups of affine type, and…

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…

In this article, we derive the list of the characteristic polynomials of the Frobenius endomorphism of simple supersingular abelian varieties of dimension $1,~2,~3,~4,~5,~6,~7$ over $\mathbb{F}_q$ where $q=p^n$, $n$ odd.

We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…

Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We give a full classification, up to equivalence, of finite-dimensional graded division algebras over the field of real numbers. The grading group is any abelian group.

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

We determine the minimal degree of a faithful permutation representation for each group of order $p^6$ where $p$ is an odd prime. We also record how to obtain such a representation.