Partial t-spreads and group constructible (s,r,μ)-nets
We give a method for constructing (s,r,μ)-nets out of partial t-spreads. As one consequence, we are able to apply a theorem of Bose and Bush to improve the known upper bound for the number of subspaces in a partial t-spread. Conversely, known existence results for partial t-spreads yield (s,r,μ)-nets with large replication number r.
KeywordsExistence Result Replication Number Group Constructible Large Replication
Unable to display preview. Download preview PDF.
- Bose, R. C. and Bush, K. A.: Orthogonal arrays of strength two and three. Annals of Math. Stat. 23 (1952), 508–524.Google Scholar
- Drake, David A.: Partial λ-geometries and generalized Hadamard matrices over groups. Canadian J., to appear.Google Scholar
- Drake, David A. and Jungnickel, Dieter: Klingenberg structures and partial designs II: regularity and uniformity. Pacific J., to appear.Google Scholar