Nonexistence results for tight block designs

DOI10.1007/S10801-012-0395-8zbMATH Open1268.05028arXiv1110.3463OpenAlexW2051258063MaRDI QIDQ356745FDOQ356745

Jesse Short-Gershman, Peter Dukes

Publication date: 26 July 2013

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Recall that combinatorial $2s$-designs admit a classical lower bound $$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely many nontrivial tight $2s$-designs for each fixed $sge5$, although no concrete understanding of `finitely many' is given. Here, we use the Smith Bound on approximate polynomial zeros to quantify this asymptotic nonexistence. Then, we outline and employ a computer search over the remaining parameter sets to establish (as expected) that there are in fact no such designs for $5lesle9$, although the same analysis could in principle be extended to larger $s$. Additionally, we obtain strong necessary conditions for existence in the difficult case $s=4$.

Full work available at URL: https://arxiv.org/abs/1110.3463

Recommendations

• Nonexistence of nontrivial tight 8-designs
• scientific article
• On the inequalities of \(t\)-designs over a finite field
• Tight 4 and 5-designs in projective spaces
• The nonexistence of certain tight spherical designs

zbMATH Keywords

orthogonal polynomialssymmetric designDelsarte theorytight design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• A survey of perfect codes
• On tight 4-designs
• On t-designs
• On tight 6-designs
• Tight 4-designs
• \((2s-1)\)-designs with \(s\) intersection numbers
• ON TIGHT DESIGNS
• Combinatorics of symmetric designs
• A Diophantine equation arising from tight 4-designs

Cited In (10)

• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials
• Nonexistence of nontrivial tight 8-designs
• Title not available (Why is that?)
• Design theory from the viewpoint of algebraic combinatorics
• Tight incomplete block designs
• Note on the tight relative 2-designs on \(H(n,2)\)
• A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes
• Relative \(t\)-designs in binary Hamming association scheme \(H(n,2)\)
• On the existence of tight relative 2-designs on binary Hamming association schemes

This page was built for publication: Nonexistence results for tight block designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356745)