Uniform binary geometries

In a geometric lattice every interval can be mapped isomorphically into an upper interval (containing 1) by a strong map. A natural question thus arises as to what extent certain assumptions on the upper interval structure determine the whole lattice. We consider conditions of the following sort: that above a certain levelm any two upper intervals of the same length be isomorphic. This property, called uniformity, is studied for binary geometries. The geometries satisfying the strongest uniformity condition (m = 1) are determined (except for one open case). As is to be expected the corresponding problem for lower intervals is easier and is solved completely.