Projects per year
Abstract
Let H be a permutation group on a set Λ, which is permutationally isomorphic to a finite alternating or symmetric group A_{n} or S_{n} acting on the kelement subsets of points from {1, . . . , n}, for some arbitrary but fixed k. Suppose moreover that no isomorphism with this action is known. We show that key elements of H needed to construct such an isomorphism ϕ, such as those whose image under ϕ is an ncycle or (n − 1)cycle, can be recognised with high probability by the lengths of just four of their cycles in Λ.
Original language  English 

Pages (fromto)  117149 
Journal  Journal of Algebra Combinatorics Discrete Structures and Applications 
Volume  2 
Issue number  2 
DOIs  
Publication status  Published  May 2015 
Keywords
 Symmetric and alternating groups in subset actions
 Large base permutation groups
 Finding long cycles
Fingerprint
Dive into the research topics of 'Identifying long cycles in finite alternating and symmetric groups acting on subsets'. Together they form a unique fingerprint.Projects
 1 Finished

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A., Gent, I. P., Leonhardt, U., Mackenzie, A., Miguel, I. J., Quick, M. & Ruskuc, N.
1/09/05 → 31/08/10
Project: Standard