The complete (k, 3)-arcs of PG(2,q), q≤13

DOI10.1002/jcd.20293zbMath1260.51003MaRDI QIDQ3165561

Kris Coolsaet, Heide Sticker

Publication date: 29 October 2012

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20293

zbMATH Keywords

finite projective plane; exhaustive search; Desarguesian projective plane; isomorph-free; \((k,3)\)-arcs

Mathematics Subject Classification ID

05B25: Combinatorial aspects of finite geometries

51E21: Blocking sets, ovals, (k)-arcs

Related Items

The Complete Arcs of PG(2,31), Complete \((k,3)\)-arcs from quartic curves, On the completeness of plane cubic curves over finite fields, The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\), A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\), The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\), On the minimum size of complete arcs and minimal saturating sets in projective planes, Bounds for Arcs of Arbitrary Degree in Finite Desarguesian Planes, On the Structure of Semiovals of Small Size

Cites Work

• Maximal (\(n\),3)-arcs in PG(2,13)
• The Hesse pencil of plane cubic curves
• Maximal \((n,3)\)-arcs in PG(2,11)
• Classification of the \((n,3)\)-arcs in PG\((2,7)\)
• The complete k-arcs of PG(2, 27) and PG(2, 29)
• A full classification of the complete k‐arcs of PG(2,23) and PG(2,25)
• Isomorph-Free Exhaustive Generation
• Unnamed Item
• Unnamed Item