相关论文: Cardinality of the Dickson permutation's group of …

We study permutation polynomials through the device of the \emph{polypermutation group} of an associative ring $R$, denoted by ${\rm Pgr}(R)$. We derive some basic properties and compute the cardinality of ${\rm Pgr}(\mathbb{Z}/p^k)$ when…

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…

The $k$th Dickson polynomial of the first kind, $D_k(x) \in {\mathbb Z}[x]$, is determined by the formula: $D_k(u+1/u) = u^k + 1/u^k$, where $k \ge 0$ and $u$ is an indeterminate. These polynomials are closely related to Chebyshev…

Let $P_n$ denote the undirected path of length $n-1$. The cardinality of the set of congruence classes induced by the graph homomorphisms from $P_n$ onto $P_k$ is determined. This settles an open problem of Michels and Knauer (Disc. Math.,…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…

Rauzy classes define a partition of the set of irreducible (or indecomposable) permutations. They were defined by G. Rauzy as part of an induction algorithm for interval exchange transformations. In this article we prove an explicit formula…

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 new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

For a right invariant distance on a permutation space $S_n$ we give a sufficient condition for the cardinality of a ball of radius $R$ to grow polynomially in $n$ for fixed $R$. For the distance $\ell_1$ we show that for an integer $k$ the…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

Let B(n) be the set of pairs of permutations from the symmetric group of degree n with a 3-cycle commutator, and let A(n) be the set of those pairs which generate the symmetric or the alternating group of degree n. We find effective…

The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…

In this paper, we characterize the Grassmannian Gr$(d,n)$ in terms of the row echelon forms of rank $d$. Using this characterization, then in the case of finite field we give a polynomial-type formula for the cardinality of the…

In [1], we give Dickson's conjecture on $N^n$. In this paper, we further give Dickson's conjecture on $Z^n$ and obtain an equivalent form of Green-Tao's conjecture [2]. Based on our work, it is possible to establish a general theory that…

We prove that certain classical groups $G\subseteq {\rm GL}(d,\mathbb{R}^d)$ serve to characterize ordinary polynomials in $d$ real variables as elements of finite-dimensional subspaces of $C(\mathbb{R}^d)$ that are invariant by changes of…

Let $n$ be a positive integer and let $[n]=\{1,2,\ldots,n\}$. Let $\Gamma_n$ denote the group of permutations on $[n]$ whose restrictions to maximal proper subsets of $[n]$ are even, let $\Sigma_n$ denote the monoid of transformations on…