On inductively minimal geometries that satisfy the intersection property (Q2566810)

In the study of incidence geometries on which finite groups act flag-transitively inductively minimal pairs were classified by \textit{F. Buekenhout, M. Dehon} and the first author in [Lect. Notes Pure Appl. Math. 190, 185--190 (1997; Zbl 0889.51015)]. In particular, they showed that there is up to isomorphism exactly one inductively minimal pair of rank \(n\) admitting a diagram that has no minimal circuit of length \(>3\), such that every edge is on a unique maximal clique and such that each vertex is on either one or two maximal cliques. Furthermore, among all the inductively minimal geometries of rank at most 5 there is, up to isomorphism, precisely one of that rank that satisfies the intersection property. In the paper under review this uniqueness result for inductively minimal geometries with diagrams as above is applied to show that for a given positive integer \(n\) there is only one inductively minimal pair of rank \(n-1\) that satisfies the intersection property and that in this case the diagram of the geometry is linear. Such a geometry of rank \(n\) is realized by taking the elements of type \(i\) to be the \(i\)-subsets of a set of size \(n+1\) and symmetrized inclusion. The symmetric group of degree \(n+1\) then is the flag-transitive automorphism group of the geometry as in an inductively minimal pair.