Abstract
We show that 2-designs with given parameters v, k, λ are in one-to-one correspondence to polynomials that solve a certain differential equation and have coefficients equal to zero or one. From this result we derive an existence theorem whereby designs correspond to integer points on a sphere in Euclidean space.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Fricker, Einführung In die Gitterpunktlehre, Birkhäuser Verlag; Basel, Boston, Stuttgart. 1982.
L.G. Haĉijan, A polynomial algorithm in linear programming, Soviet Math. Dokl. Vol. 20, No.1, 191–194. 1979.
J. Siemons, On partitions and permutation groups on unordered sets, Arch. Math. Vol. 38, 391–403. 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Siemons, J. 2-Designs and a differential equation. J Geom 22, 178–182 (1984). https://doi.org/10.1007/BF01222842
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01222842