scientific article; zbMATH DE number 1189006
An \((n,3)\)-arc in a projective plane is a set of \(n\) points, no \(4\) on a line. In the current paper the classification of \((n,3)\)-arcs in \(PG(2,5)\) is given. The maximum size of an \((n,3)\)-arc in \(PG(2,5)\) is \(n=11\), and there are two nonequivalent arcs of this size. Of sizes 10 and 9 there are respectively 7 and 16 nonequivalent \((n,3)\)-arcs, in both cases two of which are complete. Here we call an \((n,3)\)-arc complete if it is not contained in a larger \((n,3)\)-arc. All \((n,3)\)-arcs with \(n\leq 8\) are incomplete. Due to the technical nature of the result and the fact that, naturally, not all details of the proofs are included, the proofs are not easily verified. For the entire collection see [Zbl 0889.00044].
- Maximal \((n,3)\)-arcs in PG(2,11)
- Maximal (n,4)-arcs in the projective plane of order 11
- An algorithm for counting arcs in higher-dimensional projective space
- The non-existence of (104,22;3,5)-arcs
- scientific article; zbMATH DE number 4142912 (Why is no real title available?)
- On the structure of (t q)-arcs in finite projective geometries
- The geometry of (t mod q)-arcs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838698)