A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)

DOI10.1007/s10623-018-00592-8zbMath1409.51007OpenAlexW2905644805MaRDI QIDQ1727380

S. Alabdullah, J. W. P. Hirschfeld

Publication date: 20 February 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-00592-8

zbMATH Keywords

arclower boundfinite projective plane

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20)

Related Items (4)

The group action on the finite projective planes of orders 53, 61, 64 ⋮ The type of a point and a characterization of the set of external points of a conic in PG(2, q), q odd ⋮ A note on sets of type \((0, mq, 2mq)_2\) in \(PG(3, q)\) ⋮ Algebraic approach to the completeness problem for \((k,n)\)-arcs in planes over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete \((k,3)\)-arcs from quartic curves
• Maximal (\(n\),3)-arcs in PG(2,13)
• Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
• Maximal \((n,3)\)-arcs in PG(2,11)
• Classification of the \((n,3)\)-arcs in PG\((2,7)\)
• Bounds for Arcs of Arbitrary Degree in Finite Desarguesian Planes
• The complete k-arcs of PG(2, 27) and PG(2, 29)
• The complete (k, 3)-arcs of PG(2,q), q≤13
• A full classification of the complete k‐arcs of PG(2,23) and PG(2,25)

This page was built for publication: A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)