A polygonal complex in euclidean 3-space E3 is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r > 2 of faces surround each edge. It is said to be regular if its symmetry group is transitive on the flags. The present paper and its successor describe a complete classification of regular polygonal complex...

One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial t-designs exist for all values of t, no non-trivial Steiner t-design with t > 5 has been constructed until now. Understandingly, the case t = 6 has received conside...

A 2-(u, k, 1) block design is a set Q of v points and a collection of k-subsets of 9, called blocks, such that any two points lie in a unique block. Such designs have been classified in [ l&S] if their automorphism group acts doubly transitively or doubly homogeneously on its points. A classification for the case of flag transitive automorphism groups is now under way Cl, 2, 91. In this paper w...

Let D:= (X,B,I) be a 2-design. For each xeX set Bx:= {jeB:xIj}, and define Xh dually for each h e B. We call D reduced if Xh = Xt implies that h = i for all h,ieB. Assume that D is a reduced 2-design with parameters v, b, k, r, X. Let G be a flag transitive automorphism group of D. By F*(G) we mean (as usual) the generalized Fitting subgroup of G which is defined to be the inverse image in G of...