Related papers: Construction of Permutation Polynomials of Certain…

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

We reduce the problem of constructing asymptotically good tree codes to the construction of triangular totally nonsingular matrices over fields with polynomially many elements. We show a connection of this problem to Birkhoff interpolation…

Recently, Jiang et al. \cite{JIANG2025102522} obtained several classes of Permutation Polynomial of the form $x+\gamma\operatorname{Tr}_q^{q^2}(h(x))$ over finite fields $\mathbb{F}_{q^2},q=2^n$. In this paper, we find the compositional…

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly…

Permutation polynomials with few terms (especially permutation binomials) attract many people due to their simple algebraic structure. Despite the great interests in the study of permutation binomials, a complete characterization of…

We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Let $F_q$ be the finite field with $q$ elements and $F_q[x_1,\ldots, x_n]$ the ring of polynomials in $n$ variables over $F_q$. In this paper we consider permutation polynomials and local permutation polynomials over $F_q[x_1,\ldots, x_n]$,…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Problem 8.1 in Astaiza et. al. asks about the relationship between the cycle decomposition of a permutation $\sigma$ and that of its symmetric tensor power $\sigma ^{\odot k}$. In this paper, we investigate this question and give formulas…

Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…

In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.