Abstract
Put θ n = # {points in PG(n,2)} and φ n = #{lines in PG(n,2)}. Let ψ be anypoint-subset of PG(n,2). It is shown thatthe sum of L = #{internal lines of ψ} and L′= #{external lines of ψ} is the same for all ψ having the same cardinality:[6pt] Theorem A If k is defined by k = |ψ| − θ n − 1, then
(The generalization of this to subsets of PG(n,3) is also obtained.) Let \(\mathcal{S}\) be a partial spreadof lines in PG(4,2) and let N denote the number of reguli contained in \(\mathcal{S}\).Use of Theorem A gives rise to a simple proof of:[6pt] Theorem B If \(\mathcal{S}\) is maximal then one of the followingholds: (i) \(\left| \mathcal{S} \right| = 5,{\text{ }}N = 10;{\text{ }}\)(ii) \(\left| \mathcal{S} \right| = 7,{\text{ }}N = 4;{\text{ }}\)(iii) \(\left| \mathcal{S} \right| = 9,{\text{ }}N = 4.\)If (i) holds then \(\mathcal{S}\) is spread in a hyperplane.It is shown that possibility (ii) is realized by precisely threeprojectively distinct types of partial spread. Explicit examplesare also given of four projectively distinct types of partialspreads which realize possibility (iii). For one of these types,type X, the four reguli have a common line. It isshown that those partial spreads in PG(4,2) of size 9 which arise, by a simple construction, from a spreadin PG(5,2), are all of type X.
Similar content being viewed by others
References
A. Beutelspacher, Partial spreads in finite projective spaces and partial designs, Math. Z. Vol. 145 (1975) pp. 211–230.
J.H. Conway, R.T. Curtis, S.P. Norton, R.A. Parker and R.A. Wilson, Atlas of Finite Groups, Clarendon Press, Oxford (1985).
N.A. Gordon, T.M. Jarvis and R. Shaw, The classes of GL(n; 2), n ≥ 6; Hull Math. Research Reports, Vol. XI No. 14 (1998), accessible from http://www.hull.ac.uk/maths/research/1998/.
R. Shaw, Double-fives and partial spreads in PG(5; 2), in: J.W.P. Hirschfeld, S.S. Magliveras & M.J. de Resmini, eds., Geometry, Combinatorial Designs and Related Structures: Proceedings of the First Pythagorean Conference, Spetses, Greece 1996, Cambridge University Press (1997) pp. 201–216.
R. Shaw, Configurations of planes in PG(5; 2); Discrete Math. Vols. 208/209 (1999) pp. 529–546.
L.H. Soicher, GRAPE: a system for computing with graphs and groups, in: L. Finkelstein and W.M. Kantor, eds., Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 11, AMS, (1993) pp. 287–291. GRAPE is available from http://www-gap.dcs.st-and.ac.uk/gap/Share/grape.html.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shaw, R. Subsets of PG(n,2) and Maximal Partial Spreads in PG(4,2). Designs, Codes and Cryptography 21, 209–222 (2000). https://doi.org/10.1023/A:1008304115031
Issue Date:
DOI: https://doi.org/10.1023/A:1008304115031