Author:
Kiermaier Michael, ,Wassermann Alfred,
Abstract
In 1985, Janko and Tran Van Trung published an algorithm for constructing symmetric designs with prescribed automorphisms.
This algorithm is based on the equations by Dembowski (1958) for tactical decompositions of point-block incidence matrices.
In the sequel, the algorithm has been generalized and improved in many articles.
In parallel, higher incidence matrices have been introduced by Wilson in 1982.
They have proven useful for obtaining several restrictions on the existence of designs.
For example, a short proof of the generalized Fisher's inequality makes use of these incidence matrices.
In this paper, we introduce a unified approach to tactical decompositions and incidence matrices.
It works for both combinatorial and subspace designs alike.
As a result, we obtain a generalized Fisher's inequality for tactical decompositions of combinatorial and subspace designs.
Moreover, our approach is explored for the construction of combinatorial and subspace designs of arbitrary strength.
Publisher
University of Zagreb, Faculty of Science, Department of Mathematics
Reference24 articles.
1. T. Beth, D. Jungnickel and H. Lenz, Design theory. Vols. I and II, Cambridge University Press, Cambridge, 1999.
2. A. Beutelspacher, Einführung in die endliche Geometrie. I: Blockpläne, Bibliographisches Institut, Mannheim, 1982.
3. R. E. Block, On the orbits of collineation groups, Math. Z. 96 (1967), 33-49.
4. R. C. Bose, A note on Fisher's inequality for balanced incomplete block designs, Ann. Math. Statistics 20 (1949), 619-620.
5. M. Braun, M. Kiermaier and A. Wassermann, \(q\)-analogs of designs: subspace designs, in: Network coding and subspace designs, Springer, Cham, 2018, 171-211.