Classification theorem for strong triangle blocking arrangements

DOI10.2298/PIM2021001MMaRDI QIDQ4985669zbMATH OpenFDO

Authors Luka Milićević

Publication date 24 April 2021

Published in Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.08639

zbMATH Keywords

blocking setsordinary linessegment arrangements

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Abstract: A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a classification theorem for strong triangle blocking arrangements. As an application, we obtain a new proof of the result of Ackerman, Buchin, Knauer, Pinchasi and Rote which says that $n$ points in general position cannot be blocked by $n-1$ points, unless $n=2,4$. We also conjecture an extremal variant of the blocking points problem.

Recommendations

• scientific article; zbMATH DE number 4015570
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• The blocking numbers of convex bodies
• Covers and blocking sets of classical generalized quadrangles
• On blocking sets in affine planes
• Blocking sets in the complement of hyperplane arrangements in projective space
• scientific article; zbMATH DE number 878888
• scientific article; zbMATH DE number 24836
• A general construction for blocking sets in finite affine geometries
• A general construction for blocking sets in finite affine geometries

Cites work

• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• Extremal problems in discrete geometry
• On sets defining few ordinary lines
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Some combinatorial problems in the plane
• There are not too many magic configurations

Cited in

(2)

• A note on the minimum number of red lines needed to pierce the intersections of blue lines
• A theorem about vectors in \(\mathbb{R}^2\) and an algebraic proof of a conjecture of Erdős and Purdy

This page was built for publication: Classification theorem for strong triangle blocking arrangements

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