An easier proof of the maximal arcs conjecture (Q4210596)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1201850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An easier proof of the maximal arcs conjecture |
scientific article; zbMATH DE number 1201850 |
Statements
An easier proof of the maximal arcs conjecture (English)
0 references
22 September 1998
0 references
maximal arcs
0 references
Desarguesian planes
0 references
0.9289730787277222
0 references
0.87840336561203
0 references
0.8722416758537292
0 references
A \((k,n)\)-arc in a projective plane of order \(q\) is a set of \(k\) points such that at most \(n\) points are on every line. If \(k\) equals \(1+(q+1)(n-1)\) which is a general upper bound then the arc is called maximal. It was a long-standing conjecture in finite geometry that a Desarguesian projective plane of odd order contains no maximal arc which was recently proved by \textit{S. Ball, A. Blokhuis} and \textit{F. Mazzoca} [Combinatorica 17, No. 1, 31-41 (1997; Zbl 0880.51003)]. In this paper a considerably simplified proof of the conjecture is presented.
0 references