Journal of Algebraic Combinatorics

, Volume 38, Issue 1, pp 103–119

# Nonexistence results for tight block designs

• Peter Dukes
• Jesse Short-Gershman
Article

## Abstract

Recall that combinatorial 2s-designs admit a classical lower bound $$b \ge\binom{v}{s}$$ 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 s≥5, 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 5≤s≤9, 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.

## Keywords

Tight design Symmetric design Orthogonal polynomials Delsarte theory

## 1 Introduction

Let vkt be positive integers and λ be a nonnegative integer. A t-(v,k,λ) design, or simply a t-design, is a pair $$(V,\mathcal{B})$$ where V is a v-set and $$\mathcal{B}$$ is a collection of k-subsets of V such that any t-subset of V is contained in exactly λ elements of $$\mathcal{B}$$. The elements of V are points and the elements of $$\mathcal{B}$$ are blocks. Since t-designs are also i-designs for it, the parameter t is typically called the strength of the design (when it is as large as possible). The number of blocks is usually denoted b and an easy double-counting argument shows $$b=\lambda\binom{v}{t} /\binom{k}{t}$$.

Suppose $$(V,\mathcal{B})$$ is a t-(v,k,λ) design. Generalizing Fisher’s Inequality, Ray-Chaudhuri and Wilson [10] showed that if t is even, say t=2s, and vk+s, then $$b \ge\binom{v}{s}$$. If equality holds in this bound, we say $$(V,\mathcal{B})$$ is tight. The trivial tight 2s-designs are those with v=k+s, where each of the $$\binom{v}{k} = \binom{v}{s}$$ k-subsets of V is a block. The case of odd strength is investigated in [5]; however, it is impossible for (2s−1)-designs to be tight in the sense of having $$\binom{v}{s-1}$$ blocks.

Returning to even strength, the full set of parameters v and k for which a tight 2s-design exists has only been determined for s=2,3. Note that, when s=1, tight 2-designs have b=v and are the ‘symmetric’ designs; see [6, 8] for surveys of this rich (yet very challenging) topic. In 1975, Ito [7] published a proof that the only nontrivial tight 4-designs are the Witt 4-(23,7,1) design and its complementary 4-(23,16,52) design, but his proof was found to be incorrect. A few years later, Enomoto, Ito, and Noda [4] proved the weaker result that there are finitely many nontrivial tight 4-designs, though still believing Ito’s initial claim to be true. Finally, in 1978, Bremner [2] successfully settled s=2 by reaffirming Ito’s result. Peterson [9] proved in 1976 that there exist no nontrivial tight 6-designs.

Bannai [1] proved that there exist only finitely many nontrivial tight 2s-designs for each s≥5. The case s=4 is quite open, and the ‘finitely many’ for s≥5 is not explicit and potentially grows with s. However, it is probably the case that there are no unknown tight 2s-designs for s≥2.

Central to these negative results is the concept of the intersection numbers of a design. An integer 0≤μ<k is an intersection number of a t-(v,k,λ) design $$(V,\mathcal{B})$$ if there exist different blocks $$B_{1},B_{2}\in\mathcal{B}$$ such that |B 1B 2|=μ. The following strong condition was discovered first by Ray-Chaudhuri and Wilson [10] and also implicitly by Delsarte [3].

### Proposition 1.1

([3, 10])

If there exists a tight 2s-(v,k,λ) design, then the zeros of the following degree s polynomial Ψ s (x) are the intersection numbers of the design, and hence they must all be nonnegative integers:
$$\varPsi_s(x)=\sum_{i=0}^s(-1)^{s-i} \frac{\binom{v-s}{i}\binom {k-i}{s-i}\binom{k-1-i}{s-i}}{\binom{s}{i}}\binom{x}{i}.$$
(1.1)

The polynomials Ψ s are known as the Gegenbauer polynomials.

Since a 2s-design with vk+s induces at least s intersection numbers [10], it follows that the zeros of Ψ s must additionally be distinct integers for tight designs. Note also that Ψ s has no dependence on λ; indeed, for tight designs $$\lambda= \binom{v}{s}\binom{k}{2s} /\binom{v}{2s}$$ and is therefore uniquely determined by v and k.

Analogously, the Lloyd polynomials L e (x) are important for the characterization of perfect e-error-correcting codes; see [13]. It is interesting that this characterization of perfect codes was completed long ago, while the open problems mentioned before Proposition 1.1 remain for tight designs. Our goal here is to revive the interest in tight designs and take a modest step toward the full characterization of their parameters.

The outline is as follows. In Sect. 2, we review the work of Bannai in [1] on the asymptotic structure of the zeros of Ψ s . Extending this, we obtain some exact bounds relevant to this analysis. Section 3 summarizes the techniques for exhausting small cases s≥5, and Sect. 4 is devoted to a partial analysis of the case s=4. An appendix of tables following the main text will prove useful to the interested reader.

## 2 Bannai’s analysis and the Smith bound

### 2.1 Notation

Assuming a tight design, let x i , for $$i = - \lfloor\frac {s}{2} \rfloor,\ldots,(0),\ldots, \lfloor\frac {s}{2} \rfloor$$, denote the zeros of Ψ s listed in increasing order. For example, the zeros of Ψ 4 and Ψ 5 are denoted x −2<x −1<x 1<x 2 and x −2<x −1<x 0<x 1<x 2, respectively.

An important parameter is the arithmetic mean of the zeros of Ψ s (x), which we will denote by $$\overline{\alpha}$$. From the coefficient of x s−1, we have
$$\overline{\alpha} = \frac {(k-s+1)(k-s)}{v-2s+1}+\frac{s-1}{2}.$$
(2.1)
It will be useful as in [1] to define the parameter α so that $$\overline{\alpha} = \alpha+(s-1)/2$$, that is,
$$\alpha= \frac{(k-s+1)(k-s)}{v-2s+1}.$$
We also define
$$\tau= \frac{v-2s+1}{k-s+1}.$$
Bannai [1] denoted this quantity by t, but we feel t should be reserved for the strength of the design.

Note τ=2 implies v=2k+1. Moreover, if v<2k, we may complement blocks, replacing k with vk and obtain v>2k. This is discussed further in Sect. 2.2.

Finally, put $$\beta= (1-\frac{1}{\tau} )\sqrt{\alpha }$$. In terms of v and k,
$$\beta= \frac{(v-k-s)\sqrt{(k-s+1)(k-s)}}{(v-2s+1)^{3/2}}.$$
In particular, β=0 if and only if v=k+s, so in some sense β can be seen as measuring the ‘nontriviality’ of a (tight) 2s-design. Note also that
Bannai’s proof of the existence of only finitely many nontrivial tight 2s-designs, s≥5, is divided into cases according to this parameter β. In particular, he proves
• for any β 0, there are only finitely many tight 2s-designs with ββ 0; and

• there exists β 0 (depending only on s), such that there are no nontrivial tight 2s-designs with β>β 0.

Here, our main goal is to compute such a β 0 explicitly for 5≤s≤9 and, by searching across all pairs (v,k) for which ββ 0, show that there are in fact zero nontrivial tight 2s-designs for these s.

### 2.2 Symmetry with respect to the parameter τ

In the analytic work which follows, it is helpful to obtain a lower bound on τ. As discussed above, we may complement blocks to assume v≥2k. The following was mentioned but not fully proven in [1].

### Lemma 2.1

Let s≥1. There are no tight 2s-designs with v=2k.

### Proof

Suppose v=2k. Then from (2.1), $$s\overline{\alpha }-\binom{s}{2} = s\alpha= \frac{s(k-s+1)(k-s)}{2(k-s)+1}$$. Without too much effort, it can be seen that the least residue of s(ks+1)(ks)(mod2(ks)+1), denoted here by r k,s , satisfies
Since kss, it follows that in all cases r k,s is an integer lying strictly between 0 and 2(ks)+1, so $$s\overline{\alpha }-\binom {s}{2}$$ is not an integer. But the integrality of $$s\overline{\alpha}$$ is necessary for the existence of a tight design since it is the sum of the zeros of Ψ s (x); therefore there are no tight 2s-designs with v=2k. □

Now, we are able to justify assuming that τ≥2 for nonexistence of tight designs.

### Proposition 2.2

Let s≥1. If there exists a nontrivial tight 2s-design with τ<2, then there also exists a nontrivial tight 2s-design with τ≥2.

### Proof

Suppose $$\mathcal{D}$$ is a nontrivial tight 2s-(v,k,λ) design with τ<2. This means kv≤2k−1 because v≠2k by Lemma 2.1, and so the complementary 2s-(v,vk,λ′) design of $$\mathcal{D}$$ is a nontrivial tight 2s-design with τ≥2. □

Incidentally, Bannai and Peterson ruled out the case τ=2, observing that it yields symmetric zeros of Ψ s about their mean $$\overline{\alpha}$$. This is a key observation.

### Proposition 2.3

([1, 9])

There does not exist any tight 2s-design with v=2k+1.

### 2.3 Hermite polynomials

Let H s (x) denote the normalized Hermite polynomial of degree s defined recursively by H 0(x)=1, H 1(x)=x, and for s≥2,
$$H_s(x) = xH_{s-1}(x)-(s-1)H_{s-2}(x).$$
Furthermore, let ξ i , $$i = - \lfloor\frac{s}{2} \rfloor,\ldots,(0),\ldots, \lfloor\frac{s}{2} \rfloor$$, denote the zeros of H s (x) listed in increasing order. It is easily seen that ξ i =−ξ i for each i. See Appendix A for a table of H s (x) and their zeros for 1≤s≤9. In particular, for the analytical work in Sect. 3, we will make use of the following known estimates.

### Proposition 2.4

1. (i)

If s is odd and s≥5, then $$\xi_{1}^{2} < \sqrt{3}$$.

2. (ii)

If s is even and s≥8, then $$\xi_{2}^{2}-\xi_{1}^{2} < \sqrt{3}$$.

3. (iii)

If s=6, then $$1.0 < \frac{\xi_{2}^{2}-\xi_{1}^{2}}{3} < 1.1$$, $$3.5 < \frac{\xi_{3}^{2}-\xi_{1}^{2}}{3} < 3.6$$, and $$3.34634 < \frac {\xi_{3}^{2}-\xi_{1}^{2}}{\xi_{2}^{2}-\xi_{1}^{2}} < 3.34635$$.

### Proof

Items (i) and (ii) are referenced in Bannai’s Proposition 13 and proven on page 126 of [12]. Item (iii) can be verified numerically. See Appendix A. (Note that Bannai’s Proposition 13 (iii) actually contains an error.) □

A useful identity is
$$H_s'(x) = sH_{s-1}(x).$$
(2.4)
For later reference we define, again as in [1],
$$\lambda_i=\lambda_i(\tau) = \biggl(1-\frac{2}{\tau} \biggr)^2 \biggl(\frac{\xi_i^2}{6} - \frac{s-1}{6} \biggr).$$
(2.5)
Informally, Proposition 16 in [1] states that as β→∞, the zeros x i of Ψ s (x) approach $$\overline{\alpha}+\beta \xi_{i}+\lambda_{i}$$. That is, when suitably normalized, Ψ s behaves like H s for large β and fixed τ.

### 2.4 The Smith bound

We now state a useful result for explicitly finding β 0. Sometimes known as the Smith bound, it is a consequence of the Gershgorin circle theorem.

### Theorem 2.5

([11])

Let P(z) be a monic polynomial of degree n and let ξ 1,…,ξ n be distinct points approximating the zeros of P(z). Define the circles
$$\varGamma_i = \biggl\{z : |z - \xi_i| \le \frac{n|P(\xi_i)|}{|Q'(\xi_i)|} \biggr\},$$
where Q(z) is the monic polynomial of degree n with zeros ξ 1,…,ξ n . Then the union of the circular regions Γ i contains all the zeros of P(z), and any connected component consisting of just m circles Γ i contains exactly m zeros of P(z) for each 1≤mn.
Let s≥1. For each $$i \in\{- \lfloor\frac{s}{2} \rfloor,\ldots,(0),\ldots, \lfloor\frac{s}{2} \rfloor\}$$, define the monic degree s polynomial (in z)
$$G_s^{(i)}(z) = \frac{s!}{\beta^s \binom{v-s}{s}} \varPsi_s(\overline{\alpha} + \beta z + \lambda_i),$$
(2.6)
and put $$z_{i} = (x_{i}-\overline{\alpha}-\lambda_{i})/\beta$$, the zero of $$G_{s}^{(i)}(z)$$ corresponding to x i .

We will see from Propositions 2.6 and 2.7 that the z i are well-approximated by the ξ i as β→∞, independently of τ.

### Proposition 2.6

Let s≥1. Then
$$|z_i - \xi_i| \le\frac{|G_s^{(i)}(\xi_i)|}{|H_{s-1}(\xi_i)|}.$$

### Proof

Simply apply Theorem 2.5 to the polynomial $$G_{s}^{(i)}(z)$$, letting Q(z)=H s (z), to get
$$|z_i - \xi_i| \le\frac{ s |G_s^{(i)}(\xi_i)| }{ |H_s'(\xi_i)| }.$$
The result now follows from (2.4). □

### 2.5 Bounding G s in terms of β

In the next proposition, it is helpful to think of the $$G_{s}^{(i)}(\xi_{i})$$ as functions of β and τ.

### Proposition 2.7

Let s≥2. For each $$i \in\{- \lfloor\frac{s}{2} \rfloor,\ldots,(0),\ldots, \lfloor\frac{s}{2} \rfloor\}$$, there exist constants B i ,C i such that whenever β>B i ,
$$\bigl|G_s^{(i)}(\xi_i)\bigr| < \frac{C_i}{\beta^2}$$
for all τ≥2.

The necessary ingredients for this result were proved in [1], although the bound was not directly stated in this form. Therefore, we omit the proof and instead focus on how to (carefully) obtain B i and C i for small s using some basic computer algebra.

### Algorithm 2.8

For fixed s and i, we may obtain constants B i and C i in Proposition 2.7 by the following procedure.
1. 1.

Using (1.1), substitute (2.1), (2.2), (2.3), and (2.5) into (2.6). To defer floating-point precision issues, we first replace ξ i in (2.5) by a symbolic parameter r.

2. 2.
This results in an expression for $$G_{s}^{(i)}(r)$$ as a rational function of β, say
$$G_s^{(i)}(r) (\beta,\tau) = \frac{p(r,\beta,\tau)}{q(\beta,\tau)}.$$
Here, the denominator is
$$q(\beta,\tau) = \beta^s \binom{v-s}{s} = \beta^s \binom{\tau^4(\tau -1)^{-2} \beta^2 +\tau+s-1}{s}.$$
(2.7)

3. 3.
Observe that q is positive for β>0 and τ≥2, and that a lower bound on q is
$$\tilde{q}(\beta,\tau) = \frac{1}{s!} \beta^{3s} \tau^{4s} (\tau-1)^{-2s}.$$
This is obtained by replacing each factor in the falling factorial of (2.7) by τ 4(τ−1)−2 β 2.

4. 4.

The numerator p(r,β,τ) is, for general r, a polynomial of degree 3s in β. However, for r=ξ i , Proposition 2.7 shows the two top coefficients, namely of β 3s and β 3s−1, vanish. Again, to maintain symbolic algebra, we artificially replace these coefficients by zero and call this polynomial $$\tilde {p}(r,\beta,\tau)$$.

5. 5.
We have
$$\beta^2 G_s^{(i)}(r) (\beta,\tau) \le \frac{\beta^2 \tilde {p}(r,\beta ,\tau)}{\tilde{q}(\beta,\tau)}.$$
Note that for r=ξ i , the right hand side is a polynomial in β −1.

6. 6.
Consider the coefficient κ j (r,τ) of β 3sj in $$\beta^{2} \tilde{p}(r,\beta,\tau)$$. With r=ξ i , compute (or upper-bound) the maxima
$$M_{j}= \sup_{\tau\ge2} \frac{|\kappa_j(\xi_i,\tau)|}{\frac {1}{s!}(\tau-1)^{-2s} \tau^{4s}}.$$
Then, estimating term-by-term,
$$\bigl|\beta^2 G_s^{(i)}(\xi_i) (\beta, \tau)\bigr| \le M_0+M_1 \beta^{-1} + M_2 \beta^{-2} + \cdots$$
for all τ≥2.

7. 7.

Construct B i ,C i so that β>B i implies M 0+M 1 β −1+M 2 β −2+⋯≤C i . Note that with sufficiently large B i and a safe choice of C i , it suffices to estimate the first few coefficients M j .

We should remark that for small s, Algorithm 2.8—even the calculation of all 3s−1 coefficient maxima M j —is essentially instantaneous on today’s personal computers. Moreover, deferring the use of floating-point arithmetic to step 5—when τ is eliminated—makes our subsequent use of floating-point numbers M j quite mild. Indeed, there is virtually no loss in taking M j as (integer) ceilings of the suprema, so that estimating for C i can be performed in ℚ.

See Appendix B for the results of this calculation for each 5≤s≤9 and all relevant indices i.

### 2.6 Bounding the zeros

We are now ready for our main result of this section. This is in Bannai’s paper [1], but with no attempt to control β.

### Proposition 2.9

Fix a positive integer s and $$i \in\{- \lfloor\frac {s}{2} \rfloor,\ldots,(0),\ldots, \lfloor\frac {s}{2} \rfloor\}$$. Put $$y_{i} = x_{i} - \overline{\alpha} - \beta\xi_{i}$$, where recall x i and ξ i are corresponding roots of Ψ s and H s , respectively. Let ϵ>0 and define
$$\widehat{\beta}(i,\epsilon) = \max \biggl\{B_i,\frac{C_i}{\epsilon D_i} \biggr\},$$
where D i =|H s−1(ξ i )|. Then for all $$\beta> \widehat{\beta}$$ and all τ≥2,
$$|y_i - \lambda_i| < \epsilon.$$

### Proof

Observe that |y i λ i |=β|z i ξ i |, since
$$x_i=\overline{\alpha}+\beta\xi_i+y_i= \overline{\alpha}+\beta z_i+\lambda_i.$$
The estimate now follows easily from Propositions 2.6 and 2.7. □

## 3 The case s≥5

### 3.1 Estimates for large β

The goal here is to provide formulas for the smallest β 0 possible (see the end of Sect. 2.1) using the B i and C i constructed in Algorithm 2.8. This task is simplified under the conditions that B i is independent of i and C i =C i . There is no loss of generality in assuming this because we can simply take $$\overline{B}$$ to be the maximum of the B i and $$\overline {C_{i}}=\max\{ C_{i},C_{-i}\}$$, and then redefine each $$B_{i} = \overline{B}$$ and $$C_{i} = C_{-i} = \overline{C_{i}}$$. In fact, this is not necessary for our explicit constructions because the constants in Appendix B satisfy the above conditions.

Again, for convenience, we denote |H s−1(ξ i )| by D i in the following proofs.

### Proposition 3.1

Let s≥5 be odd.
1. (i)
There exists β 1 such that, whenever β>β 1,
$$|y_1+y_{-1}-2y_0| < 1.$$

2. (ii)
There exists β 2 such that, whenever β>β 2,
$$|y_i+y_{-i}-y_{i-1}-y_{-(i-1)}| < 1+ \frac{\xi_i^2-\xi_{i-1}^2}{\xi_{i-1}^2-\xi_{i-2}^2}|y_{i-1}+y_{-(i-1)}-y_{i-2}-y_{-(i-2)}|$$
for $$2\le i\le\lfloor\frac{s}{2}\rfloor$$.

3. (iii)

There exists β 0(s) such that, whenever β>β 0(s) and y i +y i y i−1y −(i−1) is an integer for $$1\le i\le\lfloor\frac{s}{2}\rfloor$$, it is necessarily the case that y i +y i y i−1y −(i−1)=0 for each i.

### Proof

1. (i)
Observe that since τ≥2,
$$0 \le2(\lambda_1-\lambda_0) = \biggl(1-\frac{2}{\tau} \biggr)^2\frac{\xi_1^2}{3} < \frac {\xi_1^2}{3}.$$
(3.1)
Define
$$\epsilon_0 = \frac{1}{2} \biggl(1-\frac{\xi_1^2}{3} \biggr) \biggl(1+\frac {C_1D_0}{C_0D_1} \biggr)^{-1}\quad \text{and} \quad \beta_1 = \widehat{\beta}(0,\epsilon_0).$$
If $$\epsilon_{1}=\epsilon_{0}\frac{C_{1}D_{0}}{C_{0}D_{1}}$$, then
$$\widehat{\beta}(1,\epsilon_1)=\beta_1\quad \text {and}\quad 2\epsilon_0+2\epsilon_1=1- \frac{\xi_1^2}{3}.$$
Hence for β>β 1,
By (3.1),
$$- \biggl(1-\frac{\xi_1^2}{3} \biggr) < y_1+y_{-1}-2y_0 < 1$$
and the claim follows.

2. (ii)
For $$2\le i\le\lfloor\frac{s}{2}\rfloor$$, let
$$a_i=\frac{\xi_i^2-\xi_{i-1}^2}{\xi_{i-1}^2-\xi_{i-2}^2}\quad \text{and}\quad \epsilon_i = \frac{1}{2} \biggl(1+(1+a_i) \frac {C_{i-1}D_i}{C_iD_{i-1}}+a_i\frac{C_{i-2}D_i}{C_iD_{i-2}} \biggr)^{-1}.$$
Note if $$2\le i\le\lfloor\frac{s}{2}\rfloor$$, then
$$(\lambda_i-\lambda_{i-1}) = ( \lambda_{i-1}-\lambda_{i-2})a_i.$$
(3.2)
Define $$\beta_{2} = \max\{\widehat{\beta}(i,\epsilon_{i}):2\le i\le\lfloor\frac{s}{2}\rfloor \}$$. For β>β 2 and working as in (i),
$$\bigl|y_i+y_{-i}-y_{i-1}-y_{-(i-1)}-2( \lambda_i-\lambda_{i-1})\bigr| < 2\epsilon_i \biggl( 1+\frac{C_{i-1}D_i}{C_iD_{i-1}} \biggr).$$
(3.3)
Using (3.2) and (3.3) again with i−1 replacing i,
as required.

3. (iii)

Set β 0(s)=max{β 1,β 2} and assume that β>β 0(s) and y i +y i y i−1y −(i−1) is an integer for $$1\le i\le\lfloor\frac{s}{2}\rfloor$$. By (i), y 1+y −1−2y 0=0 since it is an integer whose absolute value is less than 1. Assume that y i−1+y −(i−1)y i−2y −(i−2)=0 for some $$2\le i\le\lfloor \frac{s}{2}\rfloor$$. Then (ii) gives the result that |y i +y i y i−1y −(i−1)| is also less than one and hence equal to 0 since it is an integer, so by induction y i +y i y i−1y −(i−1)=0 for $$1\le i\le\lfloor \frac{s}{2}\rfloor$$, and so the proof is complete.  □

### Proposition 3.2

Let s≥8 be even.
1. (i)
There exists β 1 such that, whenever β>β 1,
$$|y_2+y_{-2}-y_1-y_{-1}| < 1.$$

2. (ii)
There exists β 2 such that, whenever β>β 2,
$$|y_i+y_{-i}-y_{i-1}-y_{-(i-1)}| < 1+ \frac{\xi_i^2-\xi_{i-1}^2}{\xi_{i-1}^2-\xi_{i-2}^2}|y_{i-1}+y_{-(i-1)}-y_{i-2}-y_{-(i-2)}|$$
for $$3\le i\le\lfloor\frac{s}{2}\rfloor$$.

3. (iii)

There exists β 0(s) such that, whenever β>β 0(s) and y i +y i y i−1y −(i−1) is an integer for $$2\le i\le\lfloor\frac{s}{2}\rfloor$$, it is necessarily the case that y i +y i y i−1y −(i−1)=0 for each i.

### Proof

1. (i)
Since τ≥2,
$$0 \le2(\lambda_2-\lambda_1) = \biggl(1-\frac{2}{\tau} \biggr)^2\frac{\xi_2^2-\xi_1^2}{3} < \frac{\xi_2^2-\xi_1^2}{3}.$$
(3.4)
Define
$$\epsilon_1 = \frac{1}{2} \biggl(1-\frac{\xi_2^2-\xi_1^2}{3} \biggr) \biggl(1+\frac{C_2D_1}{C_1D_2} \biggr)^{-1}\quad \text{and}\quad \beta_1 = \widehat{\beta}(1,\epsilon_1).$$
If $$\epsilon_{2}=\epsilon_{1}\frac{C_{2}D_{1}}{C_{1}D_{2}}$$, then
$$\widehat{\beta}(2,\epsilon_2)=\beta_1\quad \text {and}\quad 2\epsilon_1+2\epsilon_2=1- \frac{\xi_2^2-\xi_1^2}{3}.$$
Hence for β>β 1,
$$\bigl|y_2+y_{-2}-y_1-y_{-1}-2( \lambda_2-\lambda_1)\bigr| < 2\epsilon_1+2 \epsilon_2=1-\frac{\xi_2^2-\xi_1^2}{3}.$$
By (3.4),
$$- \biggl(1-\frac{\xi_2^2-\xi_1^2}{3} \biggr) < y_2+y_{-2}-y_1-y_{-1} < 1$$
and the claim follows.

2. (ii)

Define ϵ i and β 2 in as in the proof of Proposition 3.1(ii), but omit i=2.

3. (iii)

Imitate the proof of Proposition 3.1(iii).  □

In the case s=6, $$\frac{\xi_{2}^{2}-\xi_{1}^{2}}{3} > 1$$. Hence it is impossible to choose a β 1 to guarantee that y 2+y −2y 1y −1=0 whenever it is an integer and β>β 1. However, combining the integrality requirements of y 2+y −2y 1y −1 and y 3+y −3y 1y −1 allows us to handle this case.

### Proposition 3.3

Let s=6. There exists β 0(6) such that, whenever β>β 0(6) and (y 2+y −2y 1y −1), (y 3+y −3y 1y −1) are both integers, it is necessarily the case that y 2+y −2y 1y −1=y 3+y −3y 1y −1=0.

### Proof

Observe
$$0 \le2(\lambda_2-\lambda_1) < \frac{\xi_2^2-\xi_1^2}{3} < 1.1\quad \text{and}\quad 0 \le2(\lambda_3-\lambda_1) < \frac{\xi_3^2-\xi_1^2}{3} < 3.6$$
by Proposition 2.4(iii). Let $$a = \frac{\xi_{3}^{2}-\xi_{1}^{2}}{\xi_{2}^{2}-\xi_{1}^{2}}$$ and define
$$\epsilon_1 = \frac{1}{2} (a-3 ) \biggl(1+a+a \frac {C_2D_1}{C_1D_2}+\frac{C_3D_1}{C_1D_3} \biggr)^{-1}\quad \text {and}\quad \beta_0(6) = \widehat{\beta}(1, \epsilon_1).$$
Then, with
$$\epsilon_2 = 2\epsilon_1 \biggl(1+\frac{C_2D_1}{C_1D_2} \biggr)\quad \text{and}\quad \epsilon_3 = 2 \epsilon_1 \biggl(1+\frac {C_3D_1}{C_1D_3} \biggr),$$
we have
Assume β>β 0(6). Then |y 2+y −2y 1y −1−2(λ 2λ 1)|<ϵ 2 implies
$$y_2+y_{-2}-y_1-y_{-1} \in\{0,1\}.$$
Likewise, |y 3+y −3y 1y −1−2(λ 3λ 1)|<ϵ 3 implies
$$y_3+y_{-3}-y_1-y_{-1} \in\{0,1,2,3\}.$$
(3.5)
If y 2+y −2y 1y −1=0, then 2(λ 2λ 1)<ϵ 2 and so 0≤2(λ 3λ 1)<ϵ 2 a. Hence y 3+y −3y 1y −1<ϵ 2 a+ϵ 3=a−3≈0.34635, and so y 3+y −3y 1y −1=0.

On the other hand, suppose y 2+y −2y 1y −1=1. Then 2(λ 2λ 1)>1−ϵ 2 and so 2(λ 3λ 1)>(1−ϵ 2)a=aϵ 2 a. Hence y 3+y −3y 1y −1>aϵ 2 aϵ 3=3, a contradiction to (3.5).

It follows that y 2+y −2y 1y −1=y 3+y −3y 1y −1=0. □

To summarize, we have the following reworking of Proposition 17 in [1], but with explicit β 0.

### Theorem 3.4

For each s≥5, there are no tight 2s-designs with β>β 0(s).

### Proof

Suppose $$x_{-\lfloor\frac{s}{2}\rfloor} < \cdots< x_{\lfloor\frac {s}{2}\rfloor}$$ are the intersection numbers of a tight 2s-design with β>β 0(s). By Proposition 2.2, we may assume τ≥2. Then, since ξ i =−ξ i and λ i =λ i , we have x i +x i x j x j =y i +y i y j y j , and this implies that y i +y i y j y j is an integer for each $$i,j \in\{(0),1,2,\dots,\lfloor\frac{s}{2}\rfloor\}$$. By Propositions 3.1(iii), 3.2(iii) and 3.3, these integers must vanish. Specifically,
Case 1:

s odd and ≥5 implies y i +y i y i−1y −(i−1)=0 for $$1\le i\le\lfloor\frac {s}{2}\rfloor$$.

Case 2:

s even and ≥8 implies y i +y i y i−1y −(i−1)=0 for $$2\le i\le\lfloor\frac {s}{2}\rfloor$$.

Case 3:

s=6 implies y 2+y −2y 1y −1=y 3+y −3y 1y −1=0.

In each case, the x i are symmetric about their arithmetic mean $$\overline{\alpha}$$. By Proposition 2 in [1], this implies v=2k+1. Proposition 2.3 says this is impossible, and the proof is therefore complete. □

### 3.2 Searching over small β

We now turn to small values of β, for which the problem becomes finite.

### Algorithm 3.5

To exclude tight 2s-designs with ββ 0, we may implement the following steps.
1. 1.

Compute β 0 from the B i ,C i as in the previous section.

2. 2.

By Propositions 2.2 and 2.3, we may restrict attention to τ>2. Since $$\alpha= \beta^{2}/(1-\frac{1}{\tau})^{2}$$, it follows that $$\alpha< 4\beta_{0}^{2}$$. Now, since $$\alpha= \bigl(s\overline {\alpha }+\binom{s}{2} \bigr)/s$$ and $$s\overline{\alpha}$$ is an integer, we have $$\alpha\in\frac{1}{s} \mathbb{Z}$$. This gives an explicit finite number of admissible α, as Bannai observed in [1].

3. 3.
Note that, under the assumption of a tight design, the expression
$$\binom{s}{2}\alpha \biggl(\alpha+\frac {2\alpha\tau-\alpha +2}{\alpha\tau^2+\tau+1} \biggr)$$
(3.6)
is an integer. This is because Proposition 5 in [1] asserts that the coefficient of x s−2 in the monic polynomial $$s!\varPsi_{s}(x)/\binom{v-s}{s}$$ is
$$\binom{s}{2}\alpha \biggl(\alpha+\frac{2\alpha\tau-\alpha +2}{\alpha\tau^2+\tau+1} \biggr)+ \binom{s}{3} \biggl(3\alpha+\frac{3s-1}{4} \biggr),$$
and the latter term is always an integer.

4. 4.
Fix α as in Step 2. Put n=ks=ατ and define
$$g_{\alpha}(n) := \binom{s}{2}\alpha^2 \biggl(1+ \frac{2n-\alpha +2}{n^2+n+\alpha} \biggr)$$
as in (3.6). As τ>2, we may take n min(α)=max{s,⌊2α⌋+1} as a lower bound for n.

5. 5.

Since $$g'_{\alpha}(n) < 0$$ for all nn min(α), it suffices to loop on integers n from n min(α) until n max(α), where $$g_{\alpha}(n_{\max}(\alpha)) \le\lfloor\binom{s}{2}\alpha^{2} \rfloor+1$$. Any pairs (k,v) which give integral g α (n) are obtained by k=n+s and $$v = \frac{n^{2}+n}{\alpha}+2s-1$$.

6. 6.

In principle, at this point the zeros of Ψ s for these pairs (k,v) can be analyzed. However, in practice we found it sufficient in all cases to merely see that $$\lambda= \binom{v}{s}\binom {k}{2s}/\binom {v}{2s}$$ was never even an integer.

We wrote a C program that implements Algorithm 3.5 for a given s and β 0, but with an important optimization. For n near n max(α), $$|g'_{\alpha}(n)|$$ is very small so it would be inefficient to loop over n in this region. Therefore, the program loops over integer values of g α (n) from ⌈g α (n max(α))⌉ and checks the integrality of the corresponding n until the derivative becomes larger than a certain threshold (in absolute value), at which point it begins looping over n from n min to a much smaller n max. The program is available by contacting the authors.

Our calculations of β 0 in step 1 are displayed in Appendix B. We can report that the method succeeds for 5≤s≤9, and probably much higher s. We have chosen to avoid continued searches for s>9 until new ideas are obtained. In particular, it would be interesting if ss 0 could be excluded for nontrivial tight 2s-designs.

### Theorem 3.6

For each 5≤s≤9, there are no nontrivial tight 2s-designs.

## 4 The case s=4

The same analytic approach that is successful for s≥5 fails when s=4. We can only guarantee that
$$0 \le2(\lambda_2-\lambda_1) < \frac{\xi_2^2-\xi_1^2}{3} = \sqrt{8/3} \approx1.63299$$
when τ≥2, and so there does not exist β 0 such that |y 2+y −2y 1y −1|<1 for all β>β 0.
However, it is possible to bound |y 2+y −2y 1y −1| away from 2. Let
$$\epsilon_1=\frac{1}{2} \bigl(2-\sqrt{8/3}\, \bigr) \biggl(1+ \frac {C_2D_1}{C_1D_2} \biggr)^{-1}\quad \text{and}\quad \beta_\star(4)=\widehat{\beta}(1,\epsilon_1).$$
Then the existence of a tight 8-design with β>β (4) and τ≥2 implies y 2+y −2y 1y −1=1 and 2(λ 2λ 1)≈1, for which
$$\tau= \frac{v-7}{k-3} \approx\frac{2}{1-\sqrt[4]{3/8}} \approx 9.1971905725.$$

We are able to obtain more precise conditions in the following result.

### Proposition 4.1

If there exists a nontrivial tight 8-design with parameters v and k, then k>25,000 and f(k,v)=0, where f(k,v) is as in Appendix  C.

### Proof

We first used Algorithm 3.5 to find that there are no nontrivial tight 8-designs with ββ (4). Thus, any tight 8-design with τ≥2 must have x 2+x −2x 1x −1=y 2+y −2y 1y −1=1. Consider the monic and root-centered polynomial
$$F(x) = 24\varPsi_4(x+\overline{\alpha})\Big/\binom{v-4}{4} = x^4+p_1 x^3+p_2 x^2 + p_3 x + p_4.$$
By Eq. (15) in [9], we have where g(k,v) is as in Appendix C. Assuming x 2+x −2x 1x −1=1, the roots of F(x) must be r 1−1/4,r 2+1/4,−r 1−1/4,−r 2+1/4 where $$r_{1}-1/4 = x_{1}-\overline{\alpha}$$ and $$r_{2}+1/4 = x_{2}-\overline{\alpha}$$ (note that $$r_{1}, r_{2} \in\frac {1}{4} \mathbb{Z}$$). Expanding,
\begin{aligned} &x^4+p_2x^2+p_3x+p_4 \\ &\quad = x^4+ \biggl(-\frac{1}{8}-r_1^2-r_2^2 \biggr)x^2+ \biggl(\frac{r_1^2}{2}-\frac{r_2^2}{2} \biggr)x+ \biggl(r_1^2-\frac {1}{16} \biggr) \biggl(r_2^2-\frac{1}{16} \biggr)\text{,} \end{aligned}
which yields
$$p_4 = \biggl(\frac{p_2}{2}+ \frac{1}{8} \biggr)^2-p_3^2.$$
(4.2)
Substituting (4.1) into (4.2) results in the equation f(k,v)=0. □

It is possible to apply the Mordell-Weil Theorem to the Diophantine equation f(k,v)=0 and obtain a crude finiteness result. We omit the details. In any case, some very recent work of Ziqing Xiang has used careful estimates on the curve f(k,v)=0 to completely rule out the existence of nontrivial tight 8-designs.

## Notes

### Acknowledgements

The authors would like to thank Jane Wodlinger for helpful discussions. Research of the authors is supported by NSERC.

## References

1. 1.
Bannai, E.: On tight designs. Q. J. Math. 28, 433–448 (1977)
2. 2.
Bremner, A.: A Diophantine equation arising from tight 4-designs. Osaka J. Math. 16, 353–356 (1979)
3. 3.
Delsarte, Ph.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10 (1973) Google Scholar
4. 4.
Enomoto, H., Ito, N., Noda, R.: Tight 4-designs. Osaka J. Math. 16, 39–43 (1979)
5. 5.
Ionin, Y.J., Shrikhande, M.S.: (2s−1)-designs with s intersection numbers. Geom. Dedic. 48, 247–265 (1993)
6. 6.
Ionin, Y.J., Shrikhande, M.S.: Combinatorics of Symmetric Designs. Cambridge University Press, New York (2006)
7. 7.
Ito, N.: On tight 4-designs. Osaka J. Math. 12, 493–522 (1975)
8. 8.
Lander, E.S.: Symmetric Designs: An Algebraic Approach. London Math. Soc. Lecture Notes, vol. 74. Cambridge University Press, New York (1983)
9. 9.
Peterson, C.: On tight 6-designs. Osaka J. Math. 14, 417–435 (1977)
10. 10.
Ray-Chaudhuri, D.K., Wilson, R.M.: On t-designs. Osaka J. Math. 12, 737–744 (1975)
11. 11.
Smith, B.T.: Error bounds for zeros of a polynomial based upon Gerschgorin’s theorems. J. ACM 17, 661–674 (1970)
12. 12.
Szegö, G.: Orthogonal polynomials. Am. Math. Soc. Colloq. Publ. 23 (1975) Google Scholar
13. 13.
van Lint, J.H.: A survey of perfect codes. Rocky Mt. J. Math. 5, 199–224 (1975)