Searching small groups
Searching for subgroups and elements is an integral part of many other algorithms, as well as being essential in the study of groups. Viewing it as a discarding process is a good paradigm for improvements, and for analogy with search algorithms for large permutation groups.
Typically the search algorithms discard cosets (of some subgroup). The analysis of these algorithms is not straightforward and multiple discarding is not yet fully analysed. Other choices of discard sets have rarely been investigated, and their analysis is more incomplete.
Unable to display preview. Download preview PDF.