𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On defining sets for projective planes

✍ Scribed by Endre Boros; Tamás Sz‘`onyi; Krisztián Tichler

Book ID
108113525
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
188 KB
Volume
303
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codewords for Projective Planes from Set
Codewords for Projective Planes from Sets of Type (s, t)
✍ J.D. Key; M.J. de Resmini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 311 KB

Let \(\Pi^{*}\) be a projective plane of order \(n^{2}\) having a Baer subplane \(\Pi\), and let \(C\) be the code of \(\Pi^{*}\) over a prime field \(\mathbf{F}_{p}\), where \(p\) divides \(n\). If \(\Pi\) contains a set \(\mathscr{H}\) of type \((s, t)\), then it is shown that the incidence vector

Doubly transitive sets of permutations c
Doubly transitive sets of permutations characterising projective planes
✍ R. P. Burn 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 295 KB

If U and V are distinct points of a projective plane and I is a line not through U or V, then to each/, there corresponds a unique mapping, 2, of the pencil of lines through U onto the pencil through V such that for any line u, U su, u c~ u2 eL if a set R is used to label the lines through U, and th

Dual blocking sets in projective and aff
Dual blocking sets in projective and affine planes
✍ Peter J. Cameron; Francesco Mazzocca; Roy Meshulam 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 191 KB

A dual blocking set is a set of points which meets every blocking set but contains no line. We establish a lower bound for the cardinality of such a set, and characterize sets meeting the bound, in projective and affine planes. A blocking set for a family ~-of sets is a set which meets every member

Maximal sets of permutations constructed
Maximal sets of permutations constructed from projective planes
✍ Peter Lorimer 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On the set of n2+ n + 1 points of a projective plane, a set of ta2 + n -I-1 permutations is constructed with the property that any two are a Hamming distance 2n + 1 apart. Another set is constructed in which every pak are a Hamming distance not greater than 2n + 1 apart. Both sets are maximal with r