Abstract
Tight t-designs are t-designs whose sizes achieve the Fisher type lower bound. We give a new necessary condition for the existence of nontrivial tight designs and then use it to show that there do not exist nontrivial tight 8-designs.
Similar content being viewed by others
References
Bannai, E.: On tight designs. Q. J. Math. 28(4), 433–448 (1977). doi:10.1093/qmath/28.4.433
Bannai, E., and Ito, T.: Unpublished (1977)
Bremner, A.: A diophantine equation arising from tight \(4\)-designs. Osaka J. Math. 16(2), 353–356 (1979). http://hdl.handle.net/11094/8744
Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Repts. Suppl. 10 (1973)
Dukes, P., Short-Gershman, J.: Nonexistence results for tight block designs. J. Algebr. Comb. 38(1), 103–119 (2013). doi:10.1007/s10801-012-0395-8
Edgar, T., Spivey, M.Z.: Multiplicative functions generalized binomial coefficients, and generalized catalan numbers. J. Integer Seq. 19(2), 737–744 (2016)
Hall Jr., M.: Combinatorial Theory, 2nd edn. Wiley, New York (1998)
Hilliker, D.L., Straus, E.G.: Determination of bounds for the solutions to those binary Diophantine equations that satisfy the hypotheses of Runge’s theorem. Trans. Am. Math. Soc. 280(2), 637–657 (1983). doi:10.1090/S0002-9947-1983-0716842-3
Hindry, M., and Silverman, J.H.: Diophantine Geometry: An Introduction (2000). http://www.springer.com/us/book/9780387989754
Lorenzini, D., and Xiang, Z.: Integral points on variable separated curves (2015)
Peterson, C.: On tight \(6\)-designs. Osaka J. Math. 14(2), 417–435 (1977). http://hdl.handle.net/11094/3990
Ray-Chaudhuri, D.K., and Wilson, R.M.: On \(t\)-designs. Osaka J. Math. 12(3), 737–744 (1975). http://hdl.handle.net/11094/7296
Runge, C.: Über ganzzahlige Lösungen von Gleichungen zwischen zwei Veränderlichen. Journal für die reine und angewandte Mathematik, 100, 425–435 (1887). http://eudml.org/doc/148675
Stroeker, R.J.: On the diophantine equation \((2y^2-3)^2 = x^2(3x^2-2)\) in connection with the existence of non-trivial tight \(4\)-designs. Indag. Math. 84(3), 353–358 (1981)
Walsh, P.G.: A quantitative version of Runge’s theorem on Diophantine equations. Acta Arith. 62(2), 157–172 (1992). http://eudml.org/doc/206487
Zannier, U.: Lecture Notes on Diophantine Analysis (2015)
Acknowledgements
It is my great pleasure to thank Eiichi Bannai for introducing me to the subject and suggesting this problem to me. I also thank Etsuko Bannai, Dino Lorenzini, Yaokun Wu and Jiacheng Xia for useful comments and discussions. I gratefully acknowledge financial support from the Office of the Vice President for Research at the University of Georgia, and from the Research and Training Group in Algebraic Geometry, Algebra and Number Theory.
Author information
Authors and Affiliations
Corresponding author
Appendices
A The thirteen degree polynomial
\(f_4(v, k) := -16384 k^{12} v+65536 k^{12}+98304 k^{11} v^2-393216 k^{11} v-253952 k^{10} v^3+786432 k^{10} v^2+1744896 k^{10} v-3309568 k^{10}+368640 k^9 v^4-327680 k^9 v^3-8724480 k^9 v^2+16547840 k^9 v-328320 k^8 v^5-1102464 k^8 v^4+17194752 k^8 v^3-21567744 k^8 v^2-49810560 k^8 v+62323584 k^8+182784 k^7 v^6+2050560 k^7 v^5-16432128 k^7 v^4-13016064 k^7 v^3+199242240 k^7 v^2-249294336 k^7 v-61184 k^6 v^7-1642240 k^6 v^6+6536960 k^6 v^5+58253568 k^6 v^4-293538048 k^6 v^3+209662720 k^6 v^2+511604992 k^6 v-488998144 k^6+10752 k^5 v^8+698880 k^5 v^7+1258752 k^5 v^6-59703552 k^5 v^5+183266304 k^5 v^4+243542016 k^5 v^3-1534814976 k^5 v^2+1466994432 k^5 v-640 k^4 v^9-143664 k^4 v^8-2296192 k^4 v^7+27050224 k^4 v^6-7038496 k^4 v^5-582955856 k^4 v^4+1856597696 k^4 v^3-1428764528 k^4 v^2-1015706784 k^4 v+974873344 k^4+7520 k^3 v^9+772608 k^3 v^8-2875616 k^3 v^7-58917568 k^3 v^6+469164960 k^3 v^5-1155170432 k^3 v^4+412538336 k^3 v^3+2031413568 k^3 v^2-1949746688 k^3 v+336 k^2 v^{10}-52816 k^2 v^9-1582560 k^2 v^8+27560816 k^2 v^7-127930016 k^2 v^6+28759472 k^2 v^5+1497511456 k^2 v^4-4944873072 k^2 v^3+6922441360 k^2 v^2-4733985888 k^2 v+1506333312 k^2-2352 k v^{10}+203472 k v^9-764688 k v^8-24513072 k v^7+293023248 k v^6-1459281552 k v^5+3929166288 k v^4-5947568016 k v^3+4733985888 k v^2-1506333312 k v+45 v^{11}+972 v^{10}-191952 v^9+2961396 v^8-14780538 v^7-18769932 v^6+544096980 v^5-2755473732 v^4+7281931941 v^3-11097146016 v^2+9310949028 v-3408102864\).
B Proof of Proposition 5.3
Lemmas B.1, B.2, B.3, and B.4, prove Proposition 5.3. The proofs of these lemmas are not difficult once the appropriate auxiliary polynomials g has been explicitly identified. Such auxiliary polynomials were obtained through an ad-hoc procedure that we will not describe here.
Lemma B.1
If \(v \in [2k, 9k]\) and \(k \ge 20000\), then \(f_4(v, k) > 0\).
Proof
Let
View \(f_4(v, k)\) and g(v, k) as polynomials in v with coefficients in \({{\mathrm{\mathbb {R}}}}[k]\). Using the fact that \(k \ge 20000\), we can check that for every \(i \ge 0\), the coefficient of \(v^i\) in \(f_4(v, k)\) is no smaller than that in g(v, k), and for some i, the coefficient of \(v^i\) in \(f_4(v, k)\) is strictly larger than that in g(v, k). So, we find that \(f_4(v, k) > g(v, k)\) since \(v \ge 2 k > 0\).
Let \(t := v / k\), so that \(t \in [2, 9]\). We have
where
One verifies that \(h_{13}\), \(h_{12}\) and \(h_{11}\) are positive when \(t \in [2, 9]\), and then the result follows. \(\square \)
Recall the definitions of real numbers a and b in Eq. (5.1):
Lemma B.2
If \(v \in [9 k, a k + b]\) and \(k \ge 100\), then \(f_4(v, k) > 0\).
Proof
Let \(t := a k + b - v\), so that \(t \in [0, (a - 9) k + b] \subseteq [0, 0.9 k]\) when \(k \ge 100\). Let
View \(f_4(a k + b - t, k)\) and g(t, k) as polynomials in k with coefficients in \({{\mathrm{\mathbb {R}}}}[t]\). Using the fact that \(t \ge 0\), we can check that for every \(i \ge 0\), the coefficient of \(k^i\) in \(f_4(a k + b - t, k)\) is no smaller than that in g(t, k), and for some i, the coefficient of \(k^i\) in \(f_4(a k + b - t, k)\) is strictly larger than that in g(t, k). So, we find that \(f_4(a k + b - t, k) > g(t, k)\) since \(k > 0\).
Let \(s := t / k\), so that \(s \in [0, 0.9]\). We have
where
One verifies that \(h_{13}\), \(h_{12}\) and \(h_{11}\) are positive when \(s \in [0, 0.9]\). Since \(k \ge 100\)
The result follows from the fact that the right-hand side of the expression above is positive when \(s \in [0, 0.9]\).
Lemma B.3
If \(a k + b + \frac{1}{100} \le v \le 10 k\) and \(k \ge 10^5\), then \(f_4(v, k) < 0\).
Proof
Let \(t := v - a k - b\), so that \(t \in [\frac{1}{100}, (10 - a) k - b] \subseteq [\frac{1}{100}, k]\) when \(k \ge 10^5\). Let
View \(f_4(a k + b + t, k)\) and g(t, k) as polynomials in k with coefficients in \({{\mathrm{\mathbb {R}}}}[t]\). Using the fact that \(t \ge \frac{1}{100}\), we can check that for every \(i \ge 0\), the coefficient of \(k^i\) in \(f_4(a k + b + t, k)\) is no larger than that in g(t, k), and for some i, the coefficient of \(k^i\) in \(f_4(a k + b + t, k)\) is strictly smaller than that in g(t, k). So, we find that \(f_4(a k + b + t, k) < g(t, k)\) since \(k > 0\). It follows from \(t \le k\) that \(g(t, k) \le g(k, k)\). It is easy to show the one variable polynomial g(k, k) takes negative value when \(k \ge 10^5\). Thus, \(f_4(v, k)< g(t, k) \le g(k, k) < 0\). \(\square \)
Lemma B.4
If \(v \in [9.24 k, 0.8 k^2]\) and \(k \ge 10^5\), then \(f_4(v, k) < 0\).
Proof
Let
View \(f_4(v, k)\) and g(v, k) as polynomials in v with coefficients in \({{\mathrm{\mathbb {R}}}}[k]\). Using the fact that \(k \ge 10^5\), we can check that for every \(i \ge 0\), the coefficient of \(v^i\) in \(f_4(v, k)\) is no larger than that in g(v, k), and for some i, the coefficient of \(v^i\) in \(f_4(v, k)\) is strictly smaller than that in g(v, k). So, we find that \(f_4(v, k) < g(v, k)\) since \(v > 0\).
Let \(t := v / k\), so that \(t \in [9.24, 0.8k]\). Let
We have
It suffices to prove that the coefficients of \(k^{12}\), \(k^{13}\) and \(t^9 k^{13}\) in Eq. (B.1) are all negative, or those coefficients in Eq. (B.2) are all negative. Since \(k \ge 10^5\), we have \(0.00026 k^2 \ge 26 k\). So, either \(v \ge 26 k\) or \(v \le 0.00026 k^2\).
Case 1: \(v \in [26 k, 0.8 k^2]\), so that \(t \in [26, 0.8 k]\) and \(t / k \in [0, 0.8]\).
Consider Eq. (B.1). The result follows from the following facts:
-
(i)
\(k - 65536 \ge 0\);
-
(ii)
\(h(t) - 298 t^9 \ge 0\) when \(t \ge 26\);
-
(iii)
\(298 - 336 (t / k) - 45 (t / k)^2 \ge 0\) when \(t / k \in [0, 0.8]\).
Case 2: \(v \in [9.24k, 0.00026 k^2]\) so that \(t \in [9.24, 0.00026 k]\) and \(t / k \in [0, 0.00026]\).
Consider Eq. (B.2). The result follows from the following facts:
-
(i)
\(k - 65536 \ge 0\);
-
(ii)
\(h(t) - 0.1 t^9 \ge 0\) when \(t \ge 9.24\);
-
(iii)
\(0.1 - 336 (t / k) - 45 (t / k)^2 \ge 0\) when \(t / k \in [0, 0.00026]\). \(\square \)
Rights and permissions
About this article
Cite this article
Xiang, Z. Nonexistence of nontrivial tight 8-designs. J Algebr Comb 47, 301–318 (2018). https://doi.org/10.1007/s10801-017-0776-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10801-017-0776-0