Aart Blokhuis 2026-11-05
Aart Blokhuis is a mathematician working in finite geometry and combinatorics. With G. Eric Moorhouse, he calculated characteristic- rank formulas for the point-hyperplane incidence matrix of a set system associated with finite quadrics, and applied them to bounds and nonexistence results for ovoids.[ref]
The coefficient field is essential to this method. For an elementary illustration, the integer matrix has rank two over , but rank one over . Relations revealed by reduction modulo a prime number can therefore constrain configurations that a characteristic-zero calculation misses. His paper on few-distance sets provides another example of turning geometric restrictions into algebraic counting bounds.[ref]
https://research.tue.nl/files/2441775/53747.pdf. Author thesis, Few-distance sets, title and mathematical development
Akihiro Munemasa 2026-11-05
Akihiro Munemasa connects finite geometry, quadratic forms and algebraic combinatorics. His author-written notes The geometry of orthogonal groups over finite fields by Akihiro Munemasa develop geometric objects and associated graphs from quadratic forms over finite fields. The preface makes the purpose explicit: the geometry supplies nontrivial examples for studying graph symmetries.[ref]
The geometry of orthogonal groups over finite fields by Akihiro Munemasa. Preface and §2, Classification of quadratic forms
For a concrete comparison over , consider and . The first vanishes on both coordinate axes, giving nonzero isotropic vectors. The second vanishes only at : a nonzero square is , and in . Thus equal-dimensional nondegenerate quadratic forms can have different Witt indices, here one and zero. The existence or absence of totally isotropic subspaces changes the incidence geometry built from the form. Munemasa's notes turn these algebraic distinctions into explicit geometric and combinatorial constructions.[ref]
Elliptic quadric 2026-11-05
Over a finite field , an elliptic quadric is the zero set in projective space of a nonsingular quadratic form on a -dimensional vector space whose Witt index is . Thus the largest vector subspaces on which the form vanishes identically have dimension , one less than for a hyperbolic form in the same dimension. The word elliptic describes this type of quadratic form.
The especially important case contains points and no projective line. A line therefore meets it in at most two points, making it an example of an ovoid. These properties make elliptic quadrics useful configurations in finite geometry and in the study of incidence ranks.[ref]
Some p-ranks Related to Orthogonal Spaces by Aart Blokhuis and G. Eric Moorhouse. section 2, orthogonal spaces and elliptic type
For example, in the equation gives an elliptic quadric. With there are six solutions, since exactly one of the first three coordinates is nonzero. With all three must be nonzero; the eight vectors give four projective points after identifying scalar multiples. There are ten points altogether, as predicts.
G. Eric Moorhouse 2026-11-05
G. Eric Moorhouse is a mathematician whose work includes finite geometry, incidence structures and coding theory. His author homepage identifies him as Eric Moorhouse and records a University of Wyoming faculty appointment beginning in 1989.[ref]
https://ericmoorhouse.org/. Author biographical statement
With Aart Blokhuis, he computed characteristic- rank formulas for the point-hyperplane incidence matrix of a set system in finite orthogonal geometries. Their calculations yield bounds on ovoids and rule out their existence in several families.[ref]
Some p-ranks Related to Orthogonal Spaces by Aart Blokhuis and G. Eric Moorhouse. Abstract and section 4
The link is that an incidence matrix converts containment statements into vectors over a finite field. A proposed geometric configuration must satisfy the resulting linear constraints, so linear algebra can prove that the configuration cannot exist. This makes incidence ranks useful structural information, rather than merely a numerical summary of a matrix. Incidence structure 2026-11-05
In the point-block convention, an incidence structure consists of a set of points, a set of blocks, and a relation specifying which points lie on which blocks. Blocks are abstract objects: distinct blocks may have identical sets of incident points unless a simplicity condition forbids this. A finite incidence structure is encoded by its incidence matrix of a set system, with entry for incidence and otherwise.
For example, take points and three blocks incident with , and . With points indexing rows, the incidence matrix of a set system isEvery point lies on two blocks, every block contains two points, and every pair of distinct points lies on exactly one block. It is a - combinatorial design. Its matrix rank is three over but two over , since its determinant is two. This illustrates why incidence and the coefficient field jointly matter in algebraic counting arguments.
Finite geometries, graphs and combinatorial designs all supply incidence structures, but additional axioms distinguish their particular classes. Merely specifying incidence does not require any balanced-design or projective-plane axioms. Typed incidence structures can include further element types, such as points, lines and planes.[ref]
