A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any
Association schemes on the set of antiflags of a projective plane
โ Scribed by I.A. Faradzev
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 525 KB
- Volume
- 127
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
A geometric construction of a symmetric primitive association scheme of rank 6 on the antiflags of a finite projective plane is given. This scheme allows one to reconstruct the initial plane up to isomorphism and polarity. It is shown that for a Desarguesian plane the corresponding scheme is non-Schurian.
๐ SIMILAR VOLUMES
For I G t < k CI u. let S(t, k, u) denote a Steiner system and let Pr, (u) be the set of all k-subsets of theset {i,2,..., u}. We partition PJ 13) into 55 mutually disjoint S(2.4, 13)'s (projective planes). This is the first known example of a complete partition of Pk(u) into disjoint S(t, k, u)'s f
In this paper we describe an algorithm for computing the dual of a projective plane curve. The algorithm requires no extension of the field of coefficients of the curve and runs in polynomial time.