Identifying long cycles in finite alternating and symmetric groups acting on subsets

zbMath1361.20007arXiv1205.6586MaRDI QIDQ307919

Steve Linton, Alice C. Niemeyer, Cheryl E. Praeger

Publication date: 5 September 2016

Published in: Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.6586

zbMATH Keywords

finding long cycleslarge base permutation groupssymmetric and alternating groups in subset actions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Symmetric groups (20B30) Probabilistic methods in group theory (20P05)

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Über die Anzahl der Lösungen von \(x^n=1\) in der symmetrischen Gruppe \(S_n\)
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• On permutations of order dividing a given integer
• Estimation Problems and Randomised Group Algorithms
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• On the proportion of permutations of order a multiple of the degree
• On some problems of a statistical group-theory. I
• On some problems of a statistical group-theory. III

This page was built for publication: Identifying long cycles in finite alternating and symmetric groups acting on subsets