# Graphs, groups, and more: celebrating Brian Alspach’s 80th and Dragan Marušič’s 65th birthdays

28 May 2018 to 1 June 2018
Koper
UTC timezone

## Triple intersection numbers of metric and cometric association schemes

Not scheduled
15m
UP FHS (Koper)

### UP FHS

#### Koper

Titov trg 5,Koper

### Speaker

Dr Janoš Vidali (University of Ljubljana)

### Description

An association scheme is called *metric* if its intersection numbers satisfy the triangle inequality, i.e., $p^h_{ij} \ne 0$ implies $|i-j| \le h \le i+j$ for some ordering of its relations. Dually, an association scheme is called *cometric* if its Krein parameters satisfy the triangle inequality for some ordering of its eigenspaces. Metric association schemes correspond precisely to distance-regular graphs, and their parameters can be derived from a subset of the intersection numbers which are usually written as the *intersection array*. Similarly, the parameters of a cometric association scheme can be computed from the *Krein array*. A package for the Sage computer algebra system has been developed for checking feasibility of a given intersection array for a distance-regular graph. It has been used to compute triple intersection numbers for certain feasible intersection arrays, from which nonexistence of the corresponding graphs has been then shown. Recently, Williford [1] has published a list of feasible Krein arrays for primitive $3$-class cometric association scheme on up to $2800$ vertices. Gavrilyuk has suggested that the above mentioned software be used to compute triple intersection numbers for the open cases in the list. We have been able to use these computations to rule out several open cases. This is joint work with Alexander Gavrilyuk. [1] J. S. Williford. [Primitive 3-class Q-polynomial association schemes](http://www.uwyo.edu/jwilliford/data/qprim3_table.html), 2017.

### Primary author

Dr Janoš Vidali (University of Ljubljana)

### Presentation Materials

There are no materials yet.