A complete classification of symmetric (31, 10, 3) designs

In recent years several authors have determined all symmetric (31, 10, 3) designs with a nontrivial automorphism. Here we describe an algorithm for the generation by computer of all symmetric (31, 10, 3) designs and find that there are precisely 151 such nonisomorphic designs. Of these, 107 have a trivial automorphism group.