Files in this item
Perfect refiners for permutation group backtracking algorithms
Item metadata
dc.contributor.author | Jefferson, Christopher | |
dc.contributor.author | Waldecker, Rebecca | |
dc.contributor.author | Wilson, Wilf A. | |
dc.date.accessioned | 2022-05-19T11:30:20Z | |
dc.date.available | 2022-05-19T11:30:20Z | |
dc.date.issued | 2023-01-01 | |
dc.identifier | 279648990 | |
dc.identifier | fb8b3bc4-7035-4e4c-9967-8d9a5a2df9f9 | |
dc.identifier | 85129056978 | |
dc.identifier.citation | Jefferson , C , Waldecker , R & Wilson , W A 2023 , ' Perfect refiners for permutation group backtracking algorithms ' , Journal of Symbolic Computation , vol. 114 , pp. 18-36 . https://doi.org/10.1016/j.jsc.2022.04.007 | en |
dc.identifier.issn | 0747-7171 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/113398713 | |
dc.identifier.uri | https://hdl.handle.net/10023/25410 | |
dc.description | We therefore thank the VolkswagenStiftung (Grant no. 93764 ) and the Royal Society (Grant code URF\R\180015) again for their financial support of this earlier work. For financial support during the more recent advances, we thank the DFG (Grant no. WA 3089/9-1) and again the Royal Society (Grant codes RGF\EA\181005 and URF\R\180015 ). | en |
dc.description.abstract | Backtrack search is a fundamental technique for computing with finite permutation groups, which has been formulated in terms of points, ordered partitions, and graphs. We provide a framework for discussing the most common forms of backtrack search in a generic way. We introduce the concept of perfect refiners to better understand and compare the pruning power available in these different settings. We also present a new formulation of backtrack search, which allows the use of graphs with additional vertices, and which is implemented in the software package VOLE. For each setting, we classify the groups and cosets for which there exist perfect refiners. Moreover, we describe perfect refiners for many naturally-occurring examples of stabilisers and transporter sets, including applications to normaliser and subgroup conjugacy problems for 2-closed groups. | |
dc.format.extent | 19 | |
dc.format.extent | 518046 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Symbolic Computation | en |
dc.subject | Backtrack search | en |
dc.subject | Permutation groups | en |
dc.subject | Refiners | en |
dc.subject | Search algorithms | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | Algebra and Number Theory | en |
dc.subject | Computational Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA75 | en |
dc.title | Perfect refiners for permutation group backtracking algorithms | en |
dc.type | Journal article | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.sponsor | The Royal Society | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Research into Equality, Diversity & Inclusion | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.contributor.institution | University of St Andrews. St Andrews GAP Centre | en |
dc.identifier.doi | 10.1016/j.jsc.2022.04.007 | |
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.