Abstract. We continue our study of Cartan schemes and their Weyl groupoids. The results in this paper provide an algorithm to determine connected simply connected Cartan schemes of rank three, where the real roots form a finite irreducible root system. The algorithm terminates: Up to equivalence there are exactly 55 such Cartan schemes, and the number of corresponding real roots varies between 6 and 37. We identify those Weyl groupoids which appear in the classification of Nichols algebras of diagonal type.

We introduce the simple notion of a "crystallographic arrangement" and prove a one-to-one correspondence between these arrangements and the connected simply connected Cartan schemes for which the real roots are a finite root system (up to equivalence on both sides). We thus obtain a more accessible definition for this very large subclass of the class of simplicial arrangements for which a complete classification is known.2010 Mathematics Subject Classification. 20F55, 52C35, 05E45.

a b s t r a c tWe adapt the generalization of root systems by the second author and H. Yamane to the terminology of category theory. We introduce Cartan schemes, associated root systems and Weyl groupoids. After some preliminary general results, we completely classify all finite Weyl groupoids with at most three objects. The classification yields the result that there exist infinitely many ''standard'', but only 9 ''exceptional'' cases.

Abstract. We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Grünbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Grünbaums conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.

Using previous results concerning the rank two and rank three cases, all connected simply connected Cartan schemes for which the real roots form a finite irreducible root system of arbitrary rank are determined. As a consequence one obtains the list of all crystallographic arrangements, a large subclass of the class of simplicial hyperplane arrangements. Supposing that the rank is at least three, the classification yields Cartan schemes of type A and B, an infinite family of series involving the types C and D, and 74 sporadic examples.