基于有向图的置换群算法(扩展版)
Permutation group algorithms based on directed graphs (extended version)
摘要:
我们介绍了一个新的框架,解决一类重要的计算问题,涉及有限的置换群,其中包括计算集稳定,交叉的子群,和同构的组合结构。我们的技术概括了“分区回溯”,这是目前国家的最先进的算法介绍了杰弗里莱昂在1991年,这启发了我们的工作。我们的回溯搜索算法是围绕顶点和弧标记的有向图,这使我们能够代表许多问题更丰富的有序分区。我们提出的理论支撑我们的框架,我们包括实验结果表明,我们的技术往往会导致更小的搜索空间比分区回溯。我们的算法的实现可作为免费软件在GraphBacktracking包的GAP。
英文摘要:
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 generalise 'partition backtrack', which is the current state-of-the-art algorithm introduced by Jeffrey Leon in 1991, and which has inspired our work. Our backtrack search algorithms are organised around vertex- and arc-labelled directed graphs, which allow us to represent many problems more richly than do ordered partitions. We present the theory underpinning our framework, and we include the results of experiments showing that our techniques often result in smaller search spaces than does partition backtrack. An implementation of our algorithms is available as free software in the GraphBacktracking package for GAP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。