Files in this item
Identifying long cycles in finite alternating and symmetric groups acting on subsets
Item metadata
dc.contributor.author | Linton, Stephen Alexander | |
dc.contributor.author | Niemeyer, Alice C. | |
dc.contributor.author | Praeger, Cheryl E. | |
dc.date.accessioned | 2015-06-05T12:10:02Z | |
dc.date.available | 2015-06-05T12:10:02Z | |
dc.date.issued | 2015-05 | |
dc.identifier | 192859369 | |
dc.identifier | 0fe814f0-cc3c-4294-8fe4-702e4a97b81d | |
dc.identifier.citation | Linton , S A , Niemeyer , A C & Praeger , C E 2015 , ' Identifying long cycles in finite alternating and symmetric groups acting on subsets ' , Journal of Algebra Combinatorics Discrete Structures and Applications , vol. 2 , no. 2 , pp. 117-149 . https://doi.org/10.13069/jacodesmath.28239 | en |
dc.identifier.issn | 2148-838X | |
dc.identifier.uri | https://hdl.handle.net/10023/6762 | |
dc.description.abstract | Let H be a permutation group on a set Λ, which is permutationally isomorphic to a finite alternating or symmetric group An or Sn acting on the k-element 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 n-cycle or (n − 1)-cycle, can be recognised with high probability by the lengths of just four of their cycles in Λ. | |
dc.format.extent | 807384 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebra Combinatorics Discrete Structures and Applications | en |
dc.subject | Symmetric and alternating groups in subset actions | en |
dc.subject | Large base permutation groups | en |
dc.subject | Finding long cycles | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Identifying long cycles in finite alternating and symmetric groups acting on subsets | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.13069/jacodesmath.28239 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | EP/C523229/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.