Abstract:
We construct a polynomial-time algorithm for finding the
automorphism group of a circulant association scheme. The
correctness of the algorithm is based on a new result
generalizing the Burnside–Schur theorem (on permutation
groups having a regular cyclic subgroup) in the class of
the automorphism groups of association schemes.