0 KB179 KB25 KB200820252010Miyamoto, Izumištevilka:1letnik:3str. 59-67COBISSID:15564121ISSN:1855-3966URN:URN:NBN:SI:doc-NPFK2CFMenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneamatematikapermutacijske grupeComputation of isomorphisms of coherent configurations|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 normalizersTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije