Computation of isomorphisms of coherent configurations
Ars mathematica contemporanea, Volume 3 (2010) no. 1, pp. 59-67

See the original article notice from the Ars Mathematica Contemporanea website source

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.
DOI: 10.26493/1855-3974.44.856
Keywords: association scheme, permutation group, algebraic computation
Izumi Miyamoto. Computation of isomorphisms of coherent configurations. Ars mathematica contemporanea, Volume 3 (2010) no. 1, pp. 59-67. doi: 10.26493/1855-3974.44.856
@article{10_26493_1855_3974_44_856,
     author = {Izumi Miyamoto},
     title = {
		{Computation} of isomorphisms of coherent configurations
	},
     journal = {Ars mathematica contemporanea},
     pages = {59--67},
     year = {2010},
     volume = {3},
     number = {1},
     doi = {10.26493/1855-3974.44.856},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.44.856/}
}
TY  - JOUR
AU  - Izumi Miyamoto
TI  - Computation of isomorphisms of coherent configurations
	
JO  - Ars mathematica contemporanea
PY  - 2010
SP  - 59
EP  - 67
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.44.856/
DO  - 10.26493/1855-3974.44.856
LA  - en
ID  - 10_26493_1855_3974_44_856
ER  - 
%0 Journal Article
%A Izumi Miyamoto
%T Computation of isomorphisms of coherent configurations
	
%J Ars mathematica contemporanea
%D 2010
%P 59-67
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.26493/1855-3974.44.856/
%R 10.26493/1855-3974.44.856
%G en
%F 10_26493_1855_3974_44_856

Cited by Sources: