On the minimum number of points covered by a set of lines in PG(2,q)

DOI10.1007/S10623-013-9851-2MaRDI QIDQ488252zbMATH OpenOpenAlexFDO

Authors Eun Ju Cheon, Seon Jeong Kim

Publication date 23 January 2015

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

Full work available at URL https://doi.org/10.1007/s10623-013-9851-2

zbMATH Keywords

arcrational pointhyperovalprojective planeconiclargest arc

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Rational points (14G05) Blocking sets, ovals, (k)-arcs (51E21) Finite affine and projective planes (geometric aspects) (51E15)

Recommendations

• Complete arcs and algebraic curves in \(\text{PG}(2,q)\)
• The number of points on a curve, and applications. Arcs and curves: the legacy of Beniamino Segre
• scientific article; zbMATH DE number 4081719
• Algebraic curves and maximal arcs
• Minimal Symmetric Differences of Lines in Projective Planes

Cites work

• scientific article; zbMATH DE number 736288 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• Bounds on (n,r)-arcs and their application to linear codes
• Le geometrie di Galois
• On the stability of sets of even type
• The minimal number of lines intersected by a set of \(q+2\) points, blocking sets, and intersecting circles

Cited in

(1)

• How many translates of a small set are needed to cover the line?

This page was built for publication: On the minimum number of points covered by a set of lines in \(\mathrm{PG}(2,q)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488252)