A spectral characterisation of t -designs and its applications
From MaRDI portal
(Redirected from Publication:2311611)
A spectral characterisation of \( t \)-designs and its applications
A spectral characterisation of \( t \)-designs and its applications
Abstract: There are two standard approaches to the construction of -designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding theory. The objective of this paper is to give a spectral characterisation of all -designs by introducing a characteristic Boolean function of a -design. The spectra of the characteristic functions of - Steiner systems are determined and properties of such designs are proved. Delsarte's characterisations of orthogonal arrays and -designs, which are two special cases of Delsarte's characterisation of -designs in association schemes, are slightly extended into two spectral characterisations. Another characterisation of -designs by Delsarte and Seidel is also extended into a spectral one. These spectral characterisations are then compared with the new spectral characterisation of this paper.
Recommendations
Cited in
(2)
This page was built for publication: A spectral characterisation of \( t \)-designs and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311611)