A survey on tight Euclidean t-designs and tight relative t-designs in certain association schemes
From MaRDI portal
Publication:492219
DOI10.1134/S0081543815010149zbMATH Open1319.05025arXiv1512.01726MaRDI QIDQ492219FDOQ492219
Authors: Eiichi Bannai, Etsuko Bannai, Yan Zhu 
Publication date: 20 August 2015
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Abstract: A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In this paper, we study relative t-designs in H(n,2), putting emphasis on Fisher type inequalities and the existence of tight relative t-designs. We mostly consider relative t-designs on two shells. We prove that if the weight function is constant on each shell of a relative t-design on two shells then the subset in each shell must be a combinatorial (t-1)-design. This is a generalization of the result of Kageyama who proved this under the stronger assumption that the weight function is constant on the whole block set. Using this, we define tight relative t-designs for odd t, and a strong restriction on the possible parameters of tight relative t-designs in H(n,2). We obtained a new family of such tight relative t-designs, which were unnoticed before. We will give a list of feasible parameters of such relative 3-designs with n up to 100, and then we discuss the existence and/or the non-existence of such tight relative 3-designs. We also discuss feasible parameters of tight relative 4-designs on two shells in H(n,2) with n up 50. In this study we come up with the connection on the topics of classical design theory, such as symmetric 2-designs (in particular 2-(4u-1,2u-1,u-1) Hadamard designs) and Driessen's result on the non-existence of certain 3-designs. We believe the Problem 1 and Problem 2 presented in Section 5.2 open a new way to study relative t-designs in H(n,2). We conclude our paper listing several open problems.
Full work available at URL: https://arxiv.org/abs/1512.01726
Recommendations
- On the existence of tight relative 2-designs on binary Hamming association schemes
- Tight relative 2- and 4-designs on binary Hamming association schemes
- Tight relative 2-designs on two shells in Johnson association schemes
- Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)
- Relative \(t\)-designs in Johnson association schemes for P-polynomial structure
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Two-Weight Codes
- Title not available (Why is that?)
- A family of difference sets in non-cyclic groups
- Association schemes and t-designs in regular semilattices
- Title not available (Why is that?)
- A survey on spherical designs and algebraic combinatorics on spheres
- Averaging sets: A generalization of mean values and spherical designs
- Spherical codes and designs
- Tight spherical designs. I
- Special moments
- Euclidean designs and coherent configurations
- Title not available (Why is that?)
- Tight Spherical Disigns, II
- Title not available (Why is that?)
- Construction of strongly regular graphs using affine designs
- Title not available (Why is that?)
- t-designs in projective spaces
- Cubature formulas in numerical analysis and Euclidean tight designs
- Probabilistic existence of regular combinatorial structures
- The nonexistence of certain tight spherical designs
- On t-designs
- On tight 6-designs
- Tight 4-designs
- Spherical designs and Euclidean designs
- Nonexistence results for tight block designs
- ON TIGHT DESIGNS
- A Diophantine equation arising from tight 4-designs
- New examples of Euclidean tight 4-designs
- Fisher type inequalities for Euclidean t-designs
- On antipodal Euclidean tight \((2e+1)\)-designs
- On Euclidean tight 4-designs
- Remarks on the concepts of \(t\)-designs
- On the existence of tight relative 2-designs on binary Hamming association schemes
- A Fisher type inequality for weighted regular \(t\)-wise balanced designs
- Square λ-Linked Designs
- On tight spherical designs
- On relative \(t\)-designs in polynomial association schemes
- Designs in product association schemes
- Title not available (Why is that?)
- Mixed block designs
- Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
- On t-Designs and Groups
- Designs as maximum codes in polynomial metric spaces
- Tight \(t\)-designs on two concentric spheres
- Tight relative 2- and 4-designs on binary Hamming association schemes
- The Turán problem for projective geometries
- Symmetric designs, sets with two intersection numbers and Krein parameters of incidence graphs
- Uniqueness of Certain Spherical Codes
- Title not available (Why is that?)
- Tight relative 2-designs on two shells in Johnson association schemes
Cited In (8)
- Relative \(t\)-designs in Johnson association schemes for P-polynomial structure
- Tight relative 2- and 4-designs on binary Hamming association schemes
- Tight \(t\)-designs on one shell of Johnson association schemes
- Design theory from the viewpoint of algebraic combinatorics
- Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)
- Tight relative 2-designs on two shells in Johnson association schemes
- On the existence of tight relative 2-designs on binary Hamming association schemes
This page was built for publication: A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492219)
