A bound for crystallographic arrangements (Q1998936)

The author proves without using a computer that, up to equivalence, there are only finitely many irreducible crystallographic arrangements in each rank greater than two. The proof proceeds establishing a bound for the sizes of localizations of rank two. Using the volume function on roots yields a global bound for these volumes. The main result is obtained using the pigeonhole principle.