Random remarks on permutation group algorithms
William M. Kantor · DIMACS series in discrete mathematics and theoretical computer science · 1993
Quite a few papers in these Proceedings concern goal-oriented Computational Group Theory, aimed at producing software and leading to important applications. There are also a number of papers concerned with algorithms and their inherent limitations, from a somewhat more theoretical point of view; their goal is new data structures and new mathematical approaches more than the immediate production of software. The present note is partly in the latter direction, but also partly points elsewhere: the production of new, purely mathematical theorems and directions, having algorithmic applications but capable of standing by themselves without any algorithmic components. It is my contention that such theorems can not only be of value within algorithmic contexts, but also within other areas of mathematics.