Open AccessComputation of isomorphisms of coherent configurations
Author(s) -
Izumi Miyamoto
Publication year - 2010
Publication title -
ars mathematica contemporanea
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.673
H-Index - 18
eISSN - 1855-3974
pISSN - 1855-3966
DOI - 10.26493/1855-3974.44.856
Subject(s) - transitive relation , mathematics , permutation (music) , permutation group , cyclic permutation , computation , parity of a permutation , extension (predicate logic) , partial permutation , association scheme , group (periodic table) , primitive permutation group , discrete mathematics , combinatorics , symmetric group , algorithm , computer science , programming language , acoustics , physics , organic chemistry , chemistry
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom