Abstract
Let \(\mathcal {D}\) be a non-trivial 2-\((v,\,k,\,2)\) design. Assume that G is a flag-transitive and point-quasiprimitive automorphism group of \(\mathcal {D},\) then G is of holomorph affine or almost simple type.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Camina A.R., Praeger C.E.: Line-transitive, point quasiprimitive automorphism groups of finite linear spaces are affine or almost simple. Aequ. Math. 61, 221–232 (2001).
Colburn C.J., Dinitz J.H. (eds.): Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications (Boca Raton), 2nd edn. Chapman and Hall/CRC, Boca Raton (2007).
Davies H.: Flag-transitivity and primitivity. Discret. Math. 63, 91–93 (1987).
Dembowski P.: Finite Geometries. Springer, New York (1968).
Dixon J.D., Mortimer B.: The primitive permutation groups of degree less than 1000. Math. Proc. Camb. Philos. Soc. 103, 213–238 (1988).
Fang W., Dong H., Zhou S.: Flag-transitive 2-\((v, k, 4)\) symmetric designs. Ars Comb. 95, 333–342 (2010).
Kantor W.: Primitive permutation groups of odd degree, and an application to finite projective planes. J. Algebra 106, 15–45 (1987).
Liang H., Zhou S.: Flag-transitive point-primitive automorphism groups of nonsymmetric 2-\((v, k, 2)\) designs. J. Comb. Des. 24(8), 421–435 (2016).
Liebeck M.W., Praeger C.E., Saxl J.: On the O’Nan-Scott theorem for finite primitive permutation groups. J. Aust. Math. Soc. A 44, 389–396 (1988).
O’Reilly Regueiro E.: On primitivity and reduction for flag-transitive symmetric designs. J. Comb. Theory A 109(1), 135–148 (2005).
O’Reilly Regueiro E.: Reduction for primitive flag-transitive \((v, \,k,\,4)\)-symmetric designs. Des. Codes Cryptogr. 56, 61–63 (2010).
Praeger C.E.: Finite quasiprimitive graphs. In: Surveys in Combinatorics, 1997 (London). London Mathematical Society Lecture Notes Series, vol. 241, pp. 65–85. Cambridge University Press, Cambridge (1997).
Praeger C.E.: An O’Nan-Scott theorem for finite quaprimitive permutation groups and an application to 2-arc transitive graphs. J. Lond. Math. Soc. 47(2), 227–239 (1993).
Tian D., Zhou S.: Flag-transitive point-primitive symmetric \((v, \,k, \,\lambda )\) designs with \(\lambda \) at most 100. J. Comb. Des. 21, 127–141 (2013).
Zieschang P.-H.: Flag transitive automorphism groups of 2-designs with \((r,\, \lambda )=1\). J. Algebra 118, 265–275 (1988).
Acknowledgements
The authors sincerely thank the anonymous reviewers for their very helpful suggestions and detailed comments which led to the improvement of the paper. This work was supported by the National Science Foundation of China (Grant No. 11471123) and the Natural Science Foundation of Guangdong Province (Grant No. 2017A030313001).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by L. Teirlinck.
Rights and permissions
About this article
Cite this article
Zhang, Z., Zhou, S. Flag-transitive point-quasiprimitive 2-\((v,\, k,\, 2)\) designs. Des. Codes Cryptogr. 86, 1963–1971 (2018). https://doi.org/10.1007/s10623-017-0432-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-017-0432-7