A new upper bound for the largest complete \boldmath(𝑘,𝑛)-arc in \boldmath𝑃𝐺(2,𝑞)

DOI10.1090/conm/770/15427zbMath1503.51004OpenAlexW4233390750MaRDI QIDQ5043425

S. Alabdullah, J. W. P. Hirschfeld

Publication date: 21 October 2022

Published in: Contemporary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/770/15427

zbMATH Keywords

projective planeblocking setsarcs\((k,n)\)-arcs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the size of a triple blocking set in \(\text{PG} (2,q)\)
• Multiple Blocking Sets and Arcs in Finite Planes
• On Minimum Blocking Coalitions in Small Projective Plane Games
• Baer subplanes and blocking sets
• Blocking Sets in Finite Projective Planes

This page was built for publication: A new upper bound for the largest complete \boldmath(𝑘,𝑛)-arc in \boldmath𝑃𝐺(2,𝑞)