 G. Eric Moorhouse

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]

With Aart Blokhuis, he computed characteristic-$p$ 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] 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.