engleski

Construction and cllasification of all primitive ( v, k, l) symmetric designs, v<255

All (v, k, λ) symmetric designs, v≤255, that have primitive automorphism groups are constructed and classified up to isomorphism. The construction algorithms have been developed with two different approaches to the problem. One approach is based on finding a suitable cyclic subgroup of a point stabilizer in the given primitive group. The other approach is based on the results of the theory of multipliers. It proves that, up to isomorphism, there exist exactly 142 primitive (v, k, λ) symmetric designs with v. In problem solving the software package GAP and the GAP library of primitive permutation groups are used.

Symmetric design; primitive automorphism group; difference set

nije evidentirano