Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
type: Item
instance of: scholarly article
title: Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
zbMATH Open document ID: 1159.05053
author: J. Degraer
author: Kris Coolsaet
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/129776
full work available at URL: v15i1r30.html
review text: Summary: During the past few years we have obtained several new computer classification results on association schemes and in particular distance regular and strongly regular graphs. Central to our success is the use of two algebraic constraints based on properties of the minimal idempotents \(E_{i}\) of these association schemes: the fact that they are positive semidefinite and that they have known rank. Incorporating these constraints into an actual isomorph-free exhaustive generation algorithm turns out to be somewhat complicated in practice. The main problem to be solved is that of numerical inaccuracy: we do not want to discard a potential solution because a value which is close to zero is misinterpreted as being negative (in the first case) or nonzero (in the second). In this paper we give details on how this can be accomplished and also list some new classification results that have been recently obtained using this technique: the uniqueness of the strongly regular \((126,50,13,24)\) graph and some new examples of antipodal distance regular graphs. We give an explicit description of a new antipodal distance regular 3-cover of \(K_{14}\), with vertices that can be represented as ordered triples of collinear points of the Fano plane.
Mathematics Subject Classification ID: 05E30
Mathematics Subject Classification ID: 05-04
zbMATH DE Number: 5540935
zbMATH Keywords: computer classification results
zbMATH Keywords: distance regular graphs
zbMATH Keywords: strongly regular graphs
zbMATH Keywords: algebraic constraints
zbMATH Keywords: minimal idempotents
zbMATH Keywords: assocation schemes
zbMATH Keywords: numerical inaccuracy
zbMATH Keywords: antipodal distance regular graphs
zbMATH Keywords: distance regular cover
zbMATH Keywords: Fano plane
MaRDI profile type: Publication
Recommended article: On association schemes generated by a relation or an idempotent
Recommended article: An algebraic approach to association schemes
Recommended article: Computing isomorphisms of association schemes and its application
Recommended article: Computing generating sets of minimal size in finite algebras
Recommended article: Q4254845
Recommended article: An Algorithm for Computing Minimal Associated Primes of Binomial Ideals without Producing Redundant Components
Recommended article: Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Recommended article: A Class of Association Schemes and Their Automorphisms
Recommended article: Q4783074
Recommended article: Minimal number of idempotent generators for certain algebras
description: scientific article; zbMATH DE number 5540935