New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\) (Q764397): Difference between revisions

An \((n,r)\)-arc is a set of \(n\) points of a projective plane such that some \(r\), but no \(r+1\) of them are collinear. In this article several new examples of \((n,r)\)-arcs are given. All examples are found using computer search. More precisely, the examples given in the paper are: A \((95,7)\)-arc, \((183,12)\)-arc, and a \((205,13)\)-arc in \(\mathrm{PG}(2, 17)\). A \((243,14)\)-arc and a \((264,15)\)-arc in \(\mathrm{PG}(2, 19)\). A \((58,4)\)-arc, \((291,14)\)-arc, \((313,15)\)-arc, \((335,16)\)-arc, \((361,17)\)-arc, \((385,18)\)-arc, \((437,20)\)-arc, and a \((461,21)\)-arc in \(\mathrm{PG}(2, 23)\). The authors then give two implications: They update and extend the known lower bounds on the maximal size of \((n,r)\)-arcs, and secondly they state a consequence in coding theory about the existence of certain Griesmer codes.