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

DOI10.1007/S10623-013-9851-2zbMATH Open1306.05022OpenAlexW1238762586MaRDI QIDQ488252FDOQ488252

Seon Jeong Kim, Eun Ju Cheon

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

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
• Algebraic curves and maximal arcs
• Minimal Symmetric Differences of Lines in Projective Planes

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)

Cites Work

• Title not available (Why is that?)
• Le geometrie di Galois
• Title not available (Why is that?)
• The minimal number of lines intersected by a set of \(q+2\) points, blocking sets, and intersecting circles
• On the stability of sets of even type
• Bounds on \((n,r)\)-arcs and their application to linear codes

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)