๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Embedding the complement of a minimal bl
โœ Lynn Margaret Batten ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 373 KB

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

Maps of m-pires on the projective plane
โœ Brad Jackson; Gerhard Ringel ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB
Partitions of the 4-subsets of a 13-set
โœ Leo G. Chouinard II ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 422 KB

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

Computation of the Dual of a Plane Proje
โœ Driss Bouziane; Mhammed El Kahoui ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 258 KB

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.