On the frequency of permutations containing a long cycle

Permutation-like Matrix Groups with a Maximal Cycle of Power of Odd Prime Length

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 prime or a square of a prime and the maximal cycle generates a normal subgroup, then it is similar to a permutation matrix group. In this paper, we prove that if a permutation-like matrix group contains a maximal cycle of length equal to any power of any odd prime and the maximal cycle generates a normal subgroup, then it is similar to a permutation matrix gr…

Finite primitive permutation groups and regular cycles of their elements

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product structure of $r$ direct copies of the natural action of $S_m$ or $A_m$ on $k$-sets. In this paper we reduce this conjecture to the case that $G$ is an almost simple group with socle a classical group.

Probability of generation by random permutations of given cycle type

Suppose $π$ and $π'$ are two random elements of $S_n$ with constrained cycle types such that $π$ has $x n^{1/2}$ fixed points and $yn/2$ two-cycles, and likewise $π'$ has $x' n^{1/2}$ fixed points and $y'n/2$ two-cycles. We show that the events that $G = \langle π, π' \rangle$ is transitive and $G \geq A_n$ both have probability approximately \[(1 - yy')^{1/2} \exp\left(- \frac{xx' + \frac12 x^2 y' + \frac12 {x'}^2 y}{1 - yy'}\right),\] provided $(x, x')$ is not close to $(0, \infty)$ or $(\infty, 0)$. This formula is derived from some preliminary results in a recent paper (arXiv:1904.12180) o…

Permutation-like Matrix Groups with a Maximal Cycle of Prime Square Length

A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle and the matrix dimension is a prime, then the group is similar to a permutation matrix group. This paper extends the result to the case where the matrix dimension is a square of a prime.

在具有少量生成元的置换群中寻找圈型

Finding cycle types in permutation groups with few generators

本文研究了置换群中寻找特定圈型置换的问题，证明了该问题对循环置换群可在对数空间求解，而对2生成的阿贝尔置换群及无不动点判定均为NP完全。

Almost all permutations power to a cycle of prime length

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

Cycle type of random permutations: A toolkit

We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we establish strong results about the distribution of the number of cycles whose lengths lie in a fixed but arbitrary set I. Our techniques are motivated by the theory of sieves in number theory.

Primitive permutation groups containing a cycle

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 discussed.

A Representation of Permutations with Full Cycle

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the prime field F_p, where p is an odd prime. We use the isomorphism between the symmetric group S_p of p elements and the group of PPs over F_p, and the well-known fact that permutations in S_p have the same cycle structure if and only if they are conjugate.

Affine transformations of finite vector spaces with large orders or few cycles

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 of degree n, that contain a permutation of order at least n/4. Using this result we obtain a classification of finite primitive permutation groups of affine type containing a permutation with at most four cycles.

大多数置换的某次幂是长度约为小素数的循环

Most permutations power to a cycle of small prime length

本文证明次数为 n 的大多数置换存在一个幂为长度约为 log n 的素数循环，并给出比例下界，对偶置换亦有类似结果。

Abelian Carter subgroups in finite permutation groups

We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.

Permutation groups containing a regular abelian subgroup: the tangled history of two mistakes of Burnside

A group K is said to be a B-group if every permutation group containing K as a regular subgroup is either imprimitive or 2-transitive. In the second edition of his influential textbook on finite groups, Burnside published a proof that cyclic groups of composite prime-power degree are B-groups. Ten years later in 1921 he published a proof that every abelian group of composite degree is a B-group. Both proofs are character-theoretic and both have serious flaws. Indeed, the second result is false. In this note we explain these flaws and prove that every cyclic group of composite order is a B-grou…