New refiners for permutation group search

作     者：Jefferson, Christopher Pfeiffer, Markus Waldecker, Rebecca 

作者机构：Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland Martin Luther Univ Halle Wittenberg Inst Math D-06099 Halle Germany 

出 版 物：《JOURNAL OF SYMBOLIC COMPUTATION》 (符号计算杂志)

年 卷 期：2019年第92卷

页      面：70-92页

核心收录：

学科分类：08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：DFG [Wa 3089/6-1] EPSRC CCP CoDiMa [EP/M022641/1] EPSRC [EP/M003728/1] OpenDreamKit Horizon 2020 European Research Infrastructures Project EPSRC [EP/M003728/1, EP/P026842/1, EP/M022641/1] Funding Source: UKRI 

主　　题：Backtrack search Refiners Permutation groups Algorithmic group theory Computational algebra Partition backtrack 

摘      要：Partition backtrack is the current generic state of the art algorithm to search for subgroups of a given permutation group. We describe an improvement of partition backtrack for set stabilizers and intersections of subgroups by using orbital graphs. With extensive experiments we demonstrate that our methods improve performance of partition backtrack - in some cases by several orders of magnitude. (C) 2018 The Authors. Published by Elsevier Ltd.