Geodesic
Finding the automorphism group of a~circulant association scheme in polynomial time
Zapiski Nauchnykh Seminarov POMI, Problems in the theory of representations of algebras and groups. Part 12, Tome 321 (2005), pp. 251-267

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ZNSL_2005_321_a13,
     author = {I. N. Ponomarenko},
     title = {Finding the automorphism group of a~circulant association scheme in polynomial time},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {251--267},
     publisher = {mathdoc},
     volume = {321},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2005_321_a13/}
}
TY  - JOUR
AU  - I. N. Ponomarenko
TI  - Finding the automorphism group of a~circulant association scheme in polynomial time
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2005
SP  - 251
EP  - 267
VL  - 321
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2005_321_a13/
LA  - ru
ID  - ZNSL_2005_321_a13
ER  - 
%0 Journal Article
%A I. N. Ponomarenko
%T Finding the automorphism group of a~circulant association scheme in polynomial time
%J Zapiski Nauchnykh Seminarov POMI
%D 2005
%P 251-267
%V 321
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZNSL_2005_321_a13/
%G ru
%F ZNSL_2005_321_a13
I. N. Ponomarenko. Finding the automorphism group of a~circulant association scheme in polynomial time. Zapiski Nauchnykh Seminarov POMI, Problems in the theory of representations of algebras and groups. Part 12, Tome 321 (2005), pp. 251-267. http://geodesic.mathdoc.fr/item/ZNSL_2005_321_a13/