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.

生成讲解博客的中文版本

生成AI智能校验的中文版本