The proportion of non-degenerate complementary subspaces in classical spaces
S.P. Glasby, Ferdinand Ihringer, and Sam Mattheus

TL;DR
This paper establishes a lower bound on the proportion of pairs of subspaces with trivial intersection in finite classical spaces, aiding in group recognition algorithms, especially for orthogonal groups over fields of order 2.
Contribution
It provides a new lower bound for the proportion of non-degenerate complementary subspaces intersecting trivially, including cases previously unresolved.
Findings
Lower bound depends on subset sizes, dimensions, and field size
Bound applies to classical spaces, including orthogonal groups over
Advances understanding of subspace interactions in finite classical geometries
Abstract
Given positive integers , let denote the set of -dimensional subspaces of a fixed finite vector space . Let be a non-empty subset of and let . We give a positive lower bound, depending only on , for the proportion of pairs which intersect trivially. As an application, we bound the proportion of pairs of non-degenerate subspaces of complementary dimensions in a finite classical space that intersect trivially. This problem is motivated by an algorithm for recognizing classical groups. By using techniques from algebraic graph theory, we are able to handle orthogonal groups over the field of order 2, a case which had eluded Niemeyer, Praeger, and the first author.
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · Graph theory and applications
