Computation of isomorphisms of coherent configurations

Izumi Miyamoto

Abstract


A program computing isomorphisms between association schemes was applied to speed up the computation of normalizers of permutation groups. A transitive permutation group forms an association scheme while a permutation group which may not be transitive forms a coherent configuration. In this paper we discuss the extension of the above program to compute isomorphisms between coherent configurations and show some typical examples of computing normalizers.

Keywords


association scheme, permutation group, algebraic computation

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.44.856

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications