Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Perfect refiners for permutation group backtracking algorithms   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.

24
The categories of this paper are: dg-ga
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
4
The categories of this paper are: cond-mat
31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph