Nonexistence results for tight block designs

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1007/S10801-012-0395-8" rel="nofollow">DOI 10.1007/S10801-012-0395-8</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1268.05028" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2051258063" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q356745" rel="nofollow">MaRDI QID Q356745</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q356745" rel="nofollow">FDO</a>

Authors Peter Dukes, Jesse Short-Gershman

Publication date 26 July 2013

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

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

zbMATH Keywords

orthogonal polynomialssymmetric designDelsarte theorytight design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

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$.

Recommendations

• Nonexistence of nontrivial tight 8-designs
• scientific article; zbMATH DE number 1188553
• 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

Cites work

• scientific article; zbMATH DE number 3790437 (Why is no real title available?)
• scientific article; zbMATH DE number 3477793 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A Diophantine equation arising from tight 4-designs
• A survey of perfect codes
• Combinatorics of symmetric designs
• Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
• ON TIGHT DESIGNS
• On t-designs
• On tight 4-designs
• On tight 6-designs
• Tight 4-designs
• \((2s-1)\)-designs with \(s\) intersection numbers

Cited in

(10)

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

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)