×

zbMATH — the first resource for mathematics

Large quartic groups on translation planes. II: Even order: characterization of the Ott-Schaeffer planes. (English) Zbl 1155.51302
Summary: A general theory of collineation groups generated by quartic groups of even order is considered. Applications are given to collineation groups generated by large quartic groups.
Part I, cf. Note Mat. 23 (2004-2005), No. 1, 151–166 (2005; Zbl 1154.51301).

MSC:
51E15 Finite affine and projective planes (geometric aspects)
51E23 Spreads and packing problems in finite geometry
51A40 Translation planes and spreads in linear incidence geometry
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Biliotti, Bull Belginn Math Soc
[2] Biliotti, Note Mat
[3] Büttner, Geom Dedicata 11 pp 315– (1981)
[4] Dempwolff, J Geom 19 pp 101– (1982)
[5] Foulser, J Algebra 31 pp 354– (1974)
[6] Hering, Abh Math Sem Univ Hamburg 37 pp 258– (1972)
[7] Hering, J Algebra 20 pp 633– (1972)
[8] and Projective Planes, Grad Texts in Math, Vol. 6, Springer-Verlag, New York-Berlin, 1973, 291p.
[9] and Compatibility of Baer and elation groups in translation planes in Finite Geometries (Winnipeg, 1984), and (Editors), Lecture Notes in Pure and Appl. Math., Vol. 103, Marcel Dekker, New York, 1985, pp. 163-170.
[10] Jha, Eur J Combin 7 pp 227– (1986) · Zbl 0612.51002 · doi:10.1016/S0195-6698(86)80027-0
[11] and Structure theory for point-Baer and line-Baer collineations groups in affine planes, Mostly Finite Geometries, Lecture Notes in Pure and Appl Math, Vol. 190, Marcel Dekker, New York-Basel-Hong Kong, 1997, pp. 235-277.
[12] Johnson, Int J Math Math Sci 6 pp 41– (1983)
[13] Johnson, J Algebra 54 pp 291– (1978)
[14] Johnson, J Geom 49 pp 117– (1994)
[15] Ostrom, J Algebra 14 pp 405– (1970)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.