Analysing flag-transitive point-imprimitive 2-designs (Q6088385): Difference between revisions

In the paper, methods for analyzing flag-transitive point-imprimitive designs are developed. As a result, restrictions on the automorphisms and parameters of such designs are obtained. There are many flag-transitive point-imprimitive designs for each \(\lambda\). A list of all feasible design parameters with \(\lambda = \left\{3,4\right\}\) and \(v \geq 100\) has 16 members. The authors demonstrate a sequence of lemmas and prove the next theorem. Theorem. Let \({\mathcal D}=(\mathcal P,\mathcal B)\) be a \(2-(v,k,\lambda)\) design with \(\lambda \leq 4\), which admits a flag-transitive, point-imprimitive subgroup of automorphisms. Then \(v\in \left\{15,16,36,45,96\right\}\), and \({\mathcal D}\) is one of the eleven designs listed in Theorem 2 of the authors' previous paper [``On flag-transitive imprimitive 2-designs'', Preprint, arXiv:2007.10613 [math.CO] (2020)]. Thus the classification of flag-transitive, point-imprimitive \(2-(v,k,\lambda)\) designs with \(\lambda \leq 4\) is completed. The authors use the computational algebra package Magma in the proofs for all group computations. Also, the library of primitive groups in Magma is employed.