Abstract
A t-\((n,k,\lambda )_q\) design is a set of k-dimensional subspaces, called blocks, of an n-dimensional vector space V over the finite field \(\mathbb {F}_q\) with q elements such that each t-dimensional subspace is contained in exactly \(\lambda \) blocks. A partition of the complete set of k-dimensional subspaces of V into l disjoint t-\((n, k, \lambda )_q\) designs is called a large set of t-designs over \(\mathbb {F}_q\) and denoted by \(LS_q[l](t,k,n)\). Large sets of t-designs over finite fields with \(t\ge 2\) are currently known to exist only for \(LS_2[3](2,3,8)\), \(LS_3[2](2,k,n)\) and \(LS_5[2](2,k,n)\) with integers \(n\ge 6, n\equiv 2\pmod 4\) and \(3\le k\le n-3, k \equiv 3 \pmod 4\). In this article, we use the KLP theorem to prove that an \(LS_q[l](t,k,n)\) exists for all t and q, provided that \(k > 6.1(t+1)\) and n is sufficiently large and \(\begin{bmatrix} n-s \\ k-s \end{bmatrix}_q\equiv 0 \pmod l\ \mathrm{for}\ 0\le s\le t.\)
Similar content being viewed by others
References
Braun M.: Some new designs over finite fields. Bayreuth. Math. Schr. 74, 58–68 (2005).
Braun M., Kerber A., Laue R.: Systematic construction of \(q\)-analogs of designs. Des. Codes Cryptogr. 34, 55–70 (2005).
Braun M., Kohnert A., Östergård P.R.J., Wassermann A.: Large sets of \(t\)-designs over finite fields. J. Comb. Theory Ser. A 124, 195–202 (2014).
Braun M., Etzion T., Östergård P.R.J., Vardy A., Wassermann A.: Existence of \(q\)-analogs of Steiner systems. Forum Math. Pi 4, e7 (2016).
Braun M., Kiermaier M., Kohnert A., Laue R.: Large sets of subspace designs. J. Comb. Theory Ser. A 147, 155–185 (2017).
Cameron P.J.: Generalisation of Fisher’s inequality to fields with more than one element. In: McDonough T., Mavron V. (eds.) Combinatorics. London Mathematical Society, Lecture Note Series, vol. 13, pp. 9–13 (1974).
Cameron P.J.: Locally symmetric designs. Geom. Dedic. 3, 65–76 (1974).
Charalambides C.A.: Discrete \(q\)-Distributions. Wiley, Hoboken (2016).
Colbourn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs, 2nd edn CRC Press, Boca Raton (2007).
Delsarte P.: Association schemes and \(t\)-designs in regular semilattices. J. Comb. Theory Ser. A 20, 230–243 (1976).
Etzion T., Vardy A.: On \(q\)-analogs for Steiner systems and covering designs. Adv. Math. Commun. 5, 161–176 (2011).
Fazeli A., Lovett S., Vardy A.: Nontrivial \(t\)-designs over finite fields exist for all \(t\). J. Comb. Theory Ser. A 127, 149–160 (2014).
Kiermaier M., Laue R., Wassermann A.: A new series of large sets of subspace designs over the binary field. Des. Codes Cryptogr. 86, 251–268 (2018).
Koetter R., Kschischang F.: Coding for errors and erasures in random network coding. IEEE Trans. Inform. Theory 54, 3579–3591 (2008).
Kuperberg G., Lovett S., Peled R.: Probabilistic existence of regular combinatorial structures. Geom. Funct. Anal. 27, 919–972 (2017).
Lovett S., Rao S., Vardy A.: Probabilistic existence of large sets of designs. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1545–1556. SIAM, Philadelphia (2018).
Lovett S., Rao S., Vardy A.: Probabilistic existence of large sets of designs. J. Comb. Theory Ser. A 176, 105286 (2020).
Miyakawa M., Munemasa A., Yoshiara S.: On a class of small 2-designs over GF(\(q\)). J. Comb. Des. 3, 61–77 (1995).
Ray-Chaudhuri D.K., Singhi N.M.: \(q\)-Analogues of \(t\)-designs and their existence. Linear Algebra Appl. 114(115), 57–68 (1989).
Suzuki H.: On the inequalities of \(t\)-designs over a finite field. Eur. J. Comb. 11, 601–607 (1990).
Suzuki H.: \(2\)-designs over GF(\(2^m\)). Graphs Comb. 6, 293–296 (1990).
Suzuki H.: \(2\)-designs over GF(\(q\)). Graphs Comb. 8, 381–389 (1992).
Teirlinck L.: Nontrivial \(t\)-designs without repeated blocks exist for all \(t\). Discret. Math. 65, 301–311 (1987).
Thomas S.: Designs over finite fields. Geom. Dedic. 24, 237–242 (1987).
Thomas S.: Designs and partial geometries over finite fields. Geom. Dedic. 63, 247–253 (1996).
Wan Z.: Geometry of Classical Groups over Finite Fields, 2nd edn Science Press, Beijing (2002).
Acknowledgements
The authors would like to thank the anonymous reviewers for their insightful comments and invaluable advice that greatly improved the paper. Without these comments and advice, the paper could not appear in the current form. The first author is supported by the National Natural Science Foundation of China (Grant No. 11701303) and by the K. C. Wong Magna Fund in Ningbo University. The second author is supported by the National Natural Science Foundation of China (Grant No. 11871363).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Etzion.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Bao, J., Ji, L. Large sets of t-designs over finite fields exist for all t. Des. Codes Cryptogr. 90, 1599–1609 (2022). https://doi.org/10.1007/s10623-022-01061-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01061-z