2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Extremal orthogonal arrays
Alexander L. Gavrilyuk, Sho Suda
It is known that a Delsarte -design in a -polynomial association scheme has degree at least . Following Ionin and Shrikhande who stud…
Uniqueness of an association scheme related to the Witt design on 11 points
Alexander L. Gavrilyuk, Sho Suda
It follows from Delsarte theory that the Witt - design gives rise to a -polynomial association scheme defined on the set of its blocks. In this note w…
On the multiplicities of digraph eigenvalues
Alexander L. Gavrilyuk, Sho Suda
We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this general…
On few-class -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 -class -polynomial association schemes and - and -class -bipartite association schemes (on up to , $1…
On tight -designs in Hamming association schemes
Alexander Gavrilyuk, Sho Suda, Janoš Vidali
We complete the classification of tight -designs in Hamming association schemes , i.e., that of tight orthogonal arrays of strength , which had been open since a resu…