𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximal arcs in Desarguesian planes of odd order do not exist

✍ Scribed by Simeon Ball; Aart Blokhuis; Francesco Mazzocca

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
401 KB
Volume
17
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Non-existence of Thas Maximal Arc
On the Non-existence of Thas Maximal Arcs in Odd Order Projective Planes
✍ A. Blokhuis; N. Hamilton; H. Wilbrink πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 91 KB

In this paper it is shown that given a non-degenerate elliptic quadric in the projective space PG(2n -1, q), q odd, then there does not exist a spread of PG(2n -1, q) such that each element of the spread meets the quadric in a maximal totally singular subspace. An immediate consequence is that the c

On arcs sharing the maximum number of po
On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order
✍ GΓ‘bor KorchmΓ‘ros; Angelo Sonnino πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 187 KB πŸ‘ 2 views

## Abstract The sporadic complete 12‐arc in PG(2, 13) contains eight points from a conic. In PG(2,__q__) with __q__>13 odd, all known complete __k__‐arcs sharing exactly Β½(__q__+3) points with a conic π’ž have size at most Β½(__q__+3)+2, with only two exceptions, both due to Pellegrino, which are comp

There exist Steiner triple systems of or
There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code
✍ Patric R. J. Γ–stergΓ₯rd; Olli Pottonen πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 74 KB πŸ‘ 1 views

## Abstract The codewords at distance three from a particular codeword of a perfect binary one‐error‐correcting code (of length 2^m^βˆ’1) form a Steiner triple system. It is a longstanding open problem whether every Steiner triple system of order 2^m^βˆ’1 occurs in a perfect code. It turns out that thi