Tight t-designs and squarefree integers (Q749539): Difference between revisions

The story of t-designs goes back to the combinatorial type, generalized by Delsarte-Goethals-Seidel [\textit{P. Delsarte, J. M. Goethals} and \textit{J. J. Seidel}, Geometriae Dedicata 6, 363-388 (1977; Zbl 0376.05015)] to t-designs on a sphere, and by Neumaier [\textit{A. Neumaier}, Eur. J. Comb. 2, 165-172 (1981; Zbl 0467.05017)] to t-designs in a Delsarte space, including the projective spaces \(FP^ n\) of 'lines' through the origin in \(F^{n+1}\), where F denotes the real numbers R, complex number C, quarternions H, or octonions O. Using a variety of number-theoretic methods, its energetic paper shows that tight t-designs in the projective spaces \(FP^ n\) of `lines' through the origin in \(F^{n+1}\) \((F=C\), or H) satisfy \(t\leq 5\). Such a design is a generalization of a combinatorial design. It is known that \(t\leq 5\) in the cases \(F=R\), O and that \(t\leq 11\) for tight spherical t-designs. Hence the authors' result essentially completes the classification of tight t-designs in compact connected symmetric spaces of rank 1.