On few-class $Q$-polynomial association schemes: feasible parameters and nonexistence results
Combinatorics
2019-08-28 v1
Abstract
We present the tables of feasible parameters of primitive -class -polynomial association schemes and - and -class -bipartite association schemes (on up to , , and vertices, respectively), accompanied by a number of nonexistence results for such schemes obtained by analysing triple intersection numbers of putative open cases.
Keywords
Cite
@article{arxiv.1908.10081,
title = {On few-class $Q$-polynomial association schemes: feasible parameters and nonexistence results},
author = {Alexander L. Gavrilyuk and Janoš Vidali and Jason S. Williford},
journal= {arXiv preprint arXiv:1908.10081},
year = {2019}
}