A computer search of maximal partial spreads in PG(3,q)
Maurizio Iurlo, Sandro Rajola

TL;DR
This paper uses computational methods to determine minimal sizes of maximal partial spreads in projective spaces PG(3,q) for various q, providing new bounds and complete classifications for several cases.
Contribution
It presents the first computational search results for minimal sizes of maximal partial spreads in PG(3,q) for multiple q values, including new bounds and classifications.
Findings
New minimum sizes for q=8,9,16 and q between 25 and 101.
Complete classification of sizes for q=8,9,16,25,27.
Confirmed the size 45 for q=7.
Abstract
In this work we find new minimum sizes for the maximal partial spreads of PG, for and for every such that . Furthermore, for and 27 we find all the unknown sizes between our minimums and the value . Moreover, we obtain density results also in the cases and , already studied but not yet completed. Finally, we find the known exceptional size 45 for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
