Files in this item
Permutation group algorithms based on directed graphs
Item metadata
dc.contributor.author | Jefferson, Christopher | |
dc.contributor.author | Pfeiffer, Markus | |
dc.contributor.author | Wilson, Wilf A | |
dc.contributor.author | Waldecker, Rebecca | |
dc.date.accessioned | 2021-07-29T10:30:06Z | |
dc.date.available | 2021-07-29T10:30:06Z | |
dc.date.issued | 2021-11-01 | |
dc.identifier.citation | Jefferson , C , Pfeiffer , M , Wilson , W A & Waldecker , R 2021 , ' Permutation group algorithms based on directed graphs ' , Journal of Algebra , vol. 585 , pp. 723-758 . https://doi.org/10.1016/j.jalgebra.2021.06.015 | en |
dc.identifier.issn | 0021-8693 | |
dc.identifier.other | PURE: 275228115 | |
dc.identifier.other | PURE UUID: 3b3ce806-be28-4cdc-a7b2-a4c1b70d5303 | |
dc.identifier.other | RIS: urn:9D204084E4C266664238F9DD88163B65 | |
dc.identifier.other | WOS: 000672818800025 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/97884824 | |
dc.identifier.other | ORCID: /0000-0002-3382-9603/work/97885371 | |
dc.identifier.other | Scopus: 85110160727 | |
dc.identifier.uri | https://hdl.handle.net/10023/23672 | |
dc.description | Funding: The authors would like to thank the DFG (Grant no. WA 3089/6-1) and the VolkswagenStiftung (Grant no. 93764) for financially supporting this work and projects leading up to it. The first and third authors are supported by the Royal Society (Grant codes RGF\EA\181005 and URF\R\180015). | en |
dc.description.abstract | We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures. Our techniques are inspired by and generalise 'partition backtrack', which is the current state-of-the-art algorithm introduced by Jeffrey Leon in 1991. But, instead of ordered partitions, we use labelled directed graphs to organise our backtrack search algorithms, which allows for a richer representation of many problems while often resulting in smaller search spaces. In this article we present the theory underpinning our framework, we describe our algorithms, and we show the results of some experiments. An implementation of our algorithms is available as free software in the Graph Back tracking package for GAP. | |
dc.format.extent | 36 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebra | en |
dc.rights | Copyright © 2021 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Permutation group algorithms based on directed graphs | en |
dc.type | Journal article | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.sponsor | The Royal Society | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. Centre for Research into Equality, Diversity & Inclusion | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. St Andrews GAP Centre | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1016/j.jalgebra.2021.06.015 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | URF\R\180015 | en |
dc.identifier.grantnumber | RGF\EA\181005 | 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.