Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.

Coolsaet, K., and Degraer, J.. "Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R30, 16 p.-Research Paper R30, 16 p.. <http://eudml.org/doc/129776>.

@article{Coolsaet2008,
author = {Coolsaet, K., Degraer, J.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {computer classification results; distance regular graphs; strongly regular graphs; algebraic constraints; minimal idempotents; assocation schemes; numerical inaccuracy; antipodal distance regular graphs; distance regular cover; Fano plane},
language = {eng},
number = {1},
pages = {Research Paper R30, 16 p.-Research Paper R30, 16 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.},
url = {http://eudml.org/doc/129776},
volume = {15},
year = {2008},
}

TY - JOUR
AU - Coolsaet, K.
AU - Degraer, J.
TI - Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R30, 16 p.
EP - Research Paper R30, 16 p.
LA - eng
KW - computer classification results; distance regular graphs; strongly regular graphs; algebraic constraints; minimal idempotents; assocation schemes; numerical inaccuracy; antipodal distance regular graphs; distance regular cover; Fano plane
UR - http://eudml.org/doc/129776
ER -