{"title":"Erdős–Szekeres-Type Problems in the Real Projective Plane","authors":"Martin Balko, Manfred Scheucher, Pavel Valtr","doi":"10.1007/s00454-024-00691-5","DOIUrl":null,"url":null,"abstract":"<p>We consider point sets in the real projective plane <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> 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 <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span>, which was initiated by Harborth and Möller in 1994. The notion of convex position in <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> agrees with the definition of convex sets introduced by Steinitz in 1913. For <span>\\(k \\ge 3\\)</span>, an <i>(affine) </i><i>k</i>-<i>hole</i> in a finite set <span>\\(S \\subseteq {\\mathbb {R}}^2\\)</span> is a set of <i>k</i> points from <i>S</i> in convex position with no point of <i>S</i> in the interior of their convex hull. After introducing a new notion of <i>k</i>-holes for points sets from <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span>, called <i>projective </i><i>k</i>-<i>holes</i>, we find arbitrarily large finite sets of points from <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> with no projective 8-holes, providing an analogue of a classical planar construction by Horton from 1983. We also prove that they contain only quadratically many projective <i>k</i>-holes for <span>\\(k \\le 7\\)</span>. On the other hand, we show that the number of <i>k</i>-holes can be substantially larger in <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> than in <span>\\({\\mathbb {R}}^2\\)</span> by constructing, for every <span>\\(k \\in \\{3,\\dots ,6\\}\\)</span>, sets of <i>n</i> points from <span>\\({\\mathbb {R}}^2 \\subset {{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> with <span>\\(\\Omega (n^{3-3/5k})\\)</span> projective <i>k</i>-holes and only <span>\\(O(n^2)\\)</span> affine <i>k</i>-holes. Last but not least, we prove several other results, for example about projective holes in random point sets in <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> and about some algorithmic aspects. The study of extremal problems about point sets in <span>\\({{\\,\\mathrm{{\\mathbb {R}}{\\mathcal {P}}^2}\\,}}\\)</span> opens a new area of research, which we support by posing several open problems.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"21 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00691-5","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We consider point sets in the real projective plane \({{\,\mathrm{{\mathbb {R}}{\mathcal {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 \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\), which was initiated by Harborth and Möller in 1994. The notion of convex position in \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) agrees with the definition of convex sets introduced by Steinitz in 1913. For \(k \ge 3\), an (affine) k-hole in a finite set \(S \subseteq {\mathbb {R}}^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 \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\), called projective k-holes, we find arbitrarily large finite sets of points from \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) with no projective 8-holes, providing an analogue of a classical planar construction by Horton from 1983. We also prove that they contain only quadratically many projective k-holes for \(k \le 7\). On the other hand, we show that the number of k-holes can be substantially larger in \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) than in \({\mathbb {R}}^2\) by constructing, for every \(k \in \{3,\dots ,6\}\), sets of n points from \({\mathbb {R}}^2 \subset {{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) with \(\Omega (n^{3-3/5k})\) projective k-holes and only \(O(n^2)\) affine k-holes. Last but not least, we prove several other results, for example about projective holes in random point sets in \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) and about some algorithmic aspects. The study of extremal problems about point sets in \({{\,\mathrm{{\mathbb {R}}{\mathcal {P}}^2}\,}}\) opens a new area of research, which we support by posing several open problems.
期刊介绍:
Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.