𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a generalization of Kantor's likeable planes

✍ Scribed by Mauro Biliotti; Giampaolo Menichetti


Publisher
Springer
Year
1985
Tongue
English
Weight
776 KB
Volume
17
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

✦ Synopsis


ABSTRAC'r. Generalizing an idea of Kantor [7], Johnson and Wilke [5] introduced 'elusive' sets of functions over GF(q) to represent translation planes of order q2 that admit a coltineation group of order q2 in the linear translation complement and whose kern contains GF(q). In this paper we determine explicitly all elusive sets for q even. We obtain another translation plane of order 82 .

Recently several authors ([2]-[6]

) carried out some investigations on translation planes of order q2 that admit a collineation group of order q2 in the linear translation complement and whose kern contains GF(q). This was essentially motivated by Kantor's paper [7] on 'likeable' translation planes and also by a work of Bartolone [1] on similar questions. We restrict our attention to the case of q even. Generalizing Kantor's construction, Johnson and Wilke proved that, under some additional assumptions (see below), any such plane, not being a semifield plane, may be constructed by means of a suitable set of functions over GF(q). Sets of this kind -and their associated planes -are called 'elusive'. In this paper we determine all elusive sets. Referred to the planes, our result reads as follows: THEOREM A. Let ~z be an 'elusive' plane of even order, then ~ is either a Betten plane or a Luneburg-Tits plane or the plane rc(JV) of order 8 2 exhibited in Section 3.

In this direction Ganley already showed that every likeable plane of even order is a Betten plane. Our proof makes use of Ganley's result and of a technique, due to Menichetti [9], for the study of roots of affine polynomials over Galois fields.

The elusive plane ~(Jg') exhibited in Section 3 seems to be previously unknown.


πŸ“œ SIMILAR VOLUMES


On a generalization of Rubin's theorem
✍ Dmitry A. Shabanov πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 89 KB

The work is devoted to the calculation of asymptotic value of the choice number of the complete r-partite graph K m \* r = K m,. ..,m with equal part size m. We obtained the asymptotics in the case ln r = o(ln m). The proof generalizes the classical result of A.L. Rubin for the case r = 2.