A* partial linear space* of order is a geometry of points and lines such that every pair of distinct points lie on at most one line, there are points on every line, and there are lines through any point. We also require a non-degeneracy condition such as we don’t have all the points incident with just one line, and . Now an **antiflag** is a point and line that are not incident, and the **antiflag numbers** for a partial linear space are the possible values for the number of lines on that are concurrent with . For example, a projective plane of order is a partial linear space of order with single antiflag number . A generalised quadrangle has just one antiflag number, and it is , whereas a polar space of rank at least has antiflag numbers and .

Now if there is a single antiflag number , then the partial linear space is said to be a *partial geometry*. The collinearity graph of a partial geometry is the undirected graph whose vertices are the points, and they are adjacent if they are collinear. It is not difficult to prove that the collinearity graph of any partial geometry is strongly regular; that is, it is a regular graph and there are two constants and such that for any pair of adjacent (resp. non-adjacent) vertices, there are (resp. ) common neighbours.

The antiflag condition “1 or ” is the defining axiom of a polar space, and this is a highly nontrivial result of Buekenhout and Shult (1974). Moreover, we know that a polar space of rank at least 3 is “classical” by a theorem of F. D. Veldkamp and J. Tits, and so the collinearity graph of such a partial linear space must have a rank 3 automorphism group. It then follows that the collinearity graph of a polar space is strongly regular; the rank 2 case is simpler as then we have generalised quadrangles and they are partial geometries.

So we *know* that the collinearity graphs of polar spaces are strongly regular, but is there a simpler proof of this fact?

Well, if we have something like line-transitivity then it can be done easily, but I don’t know how to prove that the number of planes on a line is constant, and this is what is needed. First we know that the collinearity graph is regular of degree by considering the points lying on the lines on any point. We show now that there is a value. Consider two points and that are not collinear. Then given a line on , there are or points on collinear with . But since one of the points on , namely , is not collinear with , we see that there is a unique point on collinear with . Since this is true of all lines on , it follows that for every pair of non-adjacent vertices, there are vertices adjacent to both.

Now suppose we have two distinct points and lying on a common line . There are two types of lines on other than : (i) those whose only point collinear with is , and (ii) those for which every point is collinear with . It suffices to count the number of the latter type of line, since then we would arrive at a constant number of common neighbours to two adjacent vertices, and this constant would be . Another way to describe these lines of type (ii) would be that they span a *plane* with . That is, if we join up all of the points on these two lines and then consider the points lying on these lines, we end up with a *singular subspace* (in the language of point-line geometries), and in particular, a projective plane of order . We then take all of the singular subspaces that contain . All that remains is to show that the number of planes on a line is constant …

Nice! A counting problem!

I solved it if I understand the problem correctly. Sadly I already thought that I solved it at least three times since I read your post yesterday, but now I am confident that my solution is correct. Do you still need a prove? Can I use some kind of LaTeX in comments?

Thanks Ferdinand. As promised by email, here is your solution to my problem! It’s so simple and elegant, I can’t believe I over-looked it.

Fix a point . For a line , define

.

Now double count the ordered pairs where

– but ,

– is not collinear with

– and are collinear.

There are possibilities for , and once we have chosen , there are possibilities for .

On the other hand, there are possibilities for , and once we’ve chose , there is a unique point on collinear with (it can’t be “all” since is not collinear with ). Therefore,

and we see that is independent of . Therefore,

.

A natural question arising from the fact that the parameter of the collinearity graph depends on is as follows: Are there two polar spaces with the same order but different number of vertices?

Based on the classification of polar spaces, it looks like the answer is no, but I don’t know how to show it axiomatically/combinatorially.

As we discussed this before privately, so I will put the one comment, which I still had, here … It is easy to see that for generalized quadrangles (GQ) or finite classical polar spaces the above is true. A slightly more elaborate calculation shows that there is also no GQ with the same parameters as a finite classical polar space (if I did this correctly). But in this case at least one interesting thing happens: A GQ with parameters and a parabolic quadric of rank d over have the same number of points. Of course the Krein condition implies that there is no GQ of such order for , but this is not completely trivial.

The above example works for general and other polar spaces.

I wanted to emphasize that (1) one can maybe use Krein conditions in proving your conjecture and (2) any combinatorial argument which does not use the Krein conditions, might be particularly interesting.

Nice observation. The bound t 2 that has an order (s, t), satisfies t > s^2.

The previous comment got messed up for some reason. Here is what I was saying:

“The bound can be proved combinatorially. Perhaps that proof can help us here. Also, can we combinatorially show that for any abstract polar space of rank , if it has an order then either or ?