Related papers: On permutations induced by tame automorphisms over…

Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…

For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…

We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…

We describe a deterministic process to associate a practical, permanent label to isomorphism classes of abelian varieties defined over finite fields with commutative endomorphism algebra as long as they are ordinary or defined over a prime…

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…

In this paper we show that an affine space is determined by the abstract group structure of its group of regular automorphisms in the category of connected affine varieties. To prove this we study commutative subgroups of the group of…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

A Frobenius difference field is an algebraically closed field of characteristic $p>0$, enriched with a symbol for $x \mapsto x^{p^m}$. We study a sentence or formula in the language of fields with a distinguished automorphism, interpreted…

We introduced positive cones in an earlier paper as a notion of ordering on central simple algebras with involution that corresponds to signatures of hermitian forms. In the current paper we describe signatures of hermitian forms directly…

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation…

An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…

We consider the problem of enumeration of primitive TSRs of order n over any finite field. Here we prove the existence of primitive TSRs of order two over binary field extensions. Moreover we give a general search algorithm for primitive…

A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…

In this paper we prove that over algebraically closed field $K$ of positive characteristic $\neq 2$ every automorphism of the group of origin-preserving automorphisms of the polynomial algebra $K[x_1,\ldots, x_n]$ ($n>3$) which fixes every…

For a rational map $\phi$ from a metric graph $\varGamma$ to a tropical projective space $\boldsymbol{TP^n}$ defined by a ratio of rational functions $f_1, \ldots, f_{n + 1}$, an automorphism $\sigma$ of $\varGamma$ induces a permutation of…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Permutation polynomials have many applications in finite fields theory, coding theory, cryptography, combinatorial design, communication theory, and so on. Permutation binomials of the form $x^{r}(x^{q-1}+a)$ over $\mathbb{F}_{q^2}$ have…

Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…

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…