Erdős–Szekeres-type problems in the real projective plane

03/14/2022
by   Martin Balko, et al.
0

We consider point sets in the real projective plane ℝP^2 and explore variants of classical extremal problems about planar point sets in this setting, with a main focus on Erdős–Szekeres-type problems. We provide asymptotically tight bounds for a variant of the Erdős–Szekeres theorem about point sets in convex position in ℝP^2, which was initiated by Harborth and Möller in 1994. The notion of convex position in ℝP^2 agrees with the definition of convex sets introduced by Steinitz in 1913. For k ≥ 3, an () k-hole in a finite set S ⊆ℝ^2 is a set of k points from S in convex position with no point of S in the interior of their convex hull. After introducing a new notion of k-holes for points sets from ℝP^2, called projective k-holes, we find arbitrarily large finite sets of points from ℝP^2 with no 8-holes, providing an analogue of a classical planar construction by Horton from 1983. We also prove that they contain only quadratically many k-holes for k ≤ 7. On the other hand, we show that the number of k-holes can be substantially larger in ℝP^2 than in ℝ^2 by constructing, for every k ∈{3,…,6}, sets of n points from ℝ^2 ⊂ℝP^2 with Ω(n^3-3/5k) k-holes and only O(n^2) k-holes. Last but not least, we prove several other results, for example about projective holes in random point sets in ℝP^2 and about some algorithmic aspects. The study of extremal problems about point sets in ℝP^2 opens a new area of research, which we support by posing several open problems.

READ FULL TEXT

page 1

page 3

page 7

page 11

page 13

page 15

page 24

page 27

research
07/17/2020

On convex holes in d-dimensional point sets

Given a finite set A ⊆ℝ^d, points a_1,a_2,…,a_ℓ∈ A form an ℓ-hole in A i...
research
11/24/2020

Realizing an m-uniform four-chromatic hypergraph with disks

We prove that for every m there is a finite point set 𝒫 in the plane suc...
research
10/21/2022

Blocking Delaunay Triangulations from the Exterior

Given two distinct point sets P and Q in the plane, we say that Q blocks...
research
02/17/2020

Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem

Hadwiger and Debrunner showed that for families of convex sets in ℝ^d wi...
research
06/30/2017

More Turán-Type Theorems for Triangles in Convex Point Sets

We study the following family of problems: Given a set of n points in co...
research
10/18/2018

On estimation of biconvex sets

A set in the Euclidean plane is said to be θ-biconvex, for some θ∈[0,π/2...
research
05/22/2018

Aperiodic points in Z^2-subshifts

We consider the structure of aperiodic points in Z^2-subshifts, and in ...

Please sign up or login with your details

Forgot password? Click here to reset