Related papers: R\'edei permutations with cycles of the same lengt…

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

We show that very simple continued fractions can be obtained for the ordinary generating functions enumerating permutations or D-permutations with a large number of independent statistics, when each cycle is given a weight $-1$. The proof…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

Motivated by the recent work of Zhi-Wei Sun on determinants involving the Legendre symbol, in this paper, we study some matrices concerning subgroups of finite fields. For example, let $q\equiv 3\pmod 4$ be an odd prime power and let $\phi$…

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

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…

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

Recently, rational functions of degree three that permute the projective line $\Bbb P^1(\Bbb F_q)$ over a finite field $ \Bbb F_q$ were determined by Ferraguti and Micheli. In the present paper, using a different method, we determine all…

We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

Let $q>2$ be a prime power and $f=-{\tt x}+t{\tt x}^q+{\tt x}^{2q-1}$, where $t\in\Bbb F_q^*$. We prove that $f$ is a permutation polynomial of $\Bbb F_{q^2}$ if and only if one of the following occurs: (i) $q$ is even and…

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$