Up to duality, there are two known families of finite (thick) generalised hexagons:
- the Split Cayley hexagons of order related to the Dickson exceptional groups .
- the Twisted Triality hexagons of order related to the Steinberg exceptional groups .
Since I will only consider generalised hexagons up to duality, I will assume that the order of a given one has . The parameter is one less than the number of points on a line, and is the number of lines on a point. To date, we do not know much about the possible values of these positive integers and . Here is what we know:
- and (Haemers and Roos, 1981)
- divides (from the multiplicities of the eigenvalues of the point graph).
- There are two (up to duality) generalised hexagons with and they have respectively (Cohen and Tits 1985).
We do not know that divides , even though the known examples satisfy this simple divisibility relation.
Here is a cool number theoretic thing I’ve observed recently, but I can’t (quite yet) prove that it is true:
Claim: If are integers greater than 1, satisfying and , then apart from a small finite number of exceptions, we have or .
I claim that the only exception is .
We know that the known examples satisfy the extra relation , and it is conceivable that such a simple looking relation holds for generalised hexagons and that it arises for some combinatorial reason. It’s simplicity is the only reason to believe that it might hold, but wouldn’t it be cool if every generalised hexagon satisfied it?