Alexander Gavrilyuk, Sho Suda, Janoš Vidali
Published 2018-09-20Version 1
We use triple intersection numbers of association schemes to show non-existence of tight $4$-designs in Hamming association schemes $H(n,6)$. Combining with a result by Noda (1979), this completes the classification of tight $4$-designs in $H(n,q)$.
3-regular colored graphs and classification of surfaces
On the classification of $\mathbb{Z}_4$-codes
A classification of plane and planar 2-trees
![QR code for arXiv:1809.07553 [math.CO]](http://oss.arxitics.com/images/favicon.svg)