On the existence of tight relative 2-designs on binary Hamming association schemes
Eiichi Bannai, Etsuko Bannai, Hideo Bannai

TL;DR
This paper investigates the structure and existence of tight relative 2-designs on two shells within binary Hamming association schemes, establishing their connection to coherent configurations and identifying cases with non-constant weights.
Contribution
It proves that tight relative 2-designs on two shells in Hamming schemes form coherent configurations and classifies their parameters for n up to 30, including cases with non-constant weights.
Findings
Tight relative 2-designs on two shells are coherent configurations.
Classification of parameters for n ≤ 30.
Existence of designs with non-constant weights for n ≡ 6 mod 8.
Abstract
It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-designs". In this paper, we want to prove how much we can develop a similar theory in the latter situation, imitating the theory in the former one. We first prove that the weight function is constant on each shell for tight relative t-designs on p shells on a wide class of Q-polynomial association schemes, including Hamming association schemes. In the theory of Euclidean t-designs on 2 concentric spheres (shells), it is known that the structure of coherent configurations is naturally attached. However, it seems difficult to prove this claim in a general context. In the case of tight 2-designs in combinatorial 2-designs, there are great many tight 2-designs, i.e., symmetric 2-designs, while there are very few…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · graph theory and CDMA systems · Coding theory and cryptography
