On few-class $Q$-polynomial association schemes: feasible parameters and nonexistence results

Alexander L. Gavrilyuk, Janoš Vidali, Jason S. Williford

We present the tables of feasible parameters of primitive $3$-class $Q$-polynomial association schemes and $4$- and $5$-class $Q$-bipartite association schemes (on up to $2800$, $1…