On Erdős-Szekeres-type problems for k-convex point sets

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10403065" target="_blank" >RIV/00216208:11320/19:10403065 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-25005-8_4" target="_blank" >https://doi.org/10.1007/978-3-030-25005-8_4</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-25005-8_4" target="_blank" >10.1007/978-3-030-25005-8_4</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Erdős-Szekeres-type problems for k-convex point sets

Popis výsledku v původním jazyce

We study Erdős-Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning simple polygonization of S such that the intersection of any straight line with its interior consists of at most k connected components. We address several open problems about k-convex point sets. In particular, we extend the well-known Erdős-Szekeres Theorem by showing that, for every fixed k ELEMENT OF N, every set of n points in the plane in general position (with no three collinear points) contains a k-convex subset of size at least Ω(logk n). We also show that there are arbitrarily large 3-convex sets of n points in the plane in general position whose largest 1-convex subset has size O(log n). This gives a solution to a problem posed by Aichholzer et al. We prove that there is a constant c &gt; 0 such that, for every n in N, there is a set S of n points in the plane in general position such that every 2-convex polygon spanned by at least c . log n points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. up to a multiplicative constant and answers another of their open problems.

Název v anglickém jazyce

On Erdős-Szekeres-type problems for k-convex point sets

Popis výsledku anglicky

We study Erdős-Szekeres-type problems for k-convex point sets, a recently introduced notion that naturally extends the concept of convex position. A finite set S of n points is k-convex if there exists a spanning simple polygonization of S such that the intersection of any straight line with its interior consists of at most k connected components. We address several open problems about k-convex point sets. In particular, we extend the well-known Erdős-Szekeres Theorem by showing that, for every fixed k ELEMENT OF N, every set of n points in the plane in general position (with no three collinear points) contains a k-convex subset of size at least Ω(logk n). We also show that there are arbitrarily large 3-convex sets of n points in the plane in general position whose largest 1-convex subset has size O(log n). This gives a solution to a problem posed by Aichholzer et al. We prove that there is a constant c &gt; 0 such that, for every n in N, there is a set S of n points in the plane in general position such that every 2-convex polygon spanned by at least c . log n points from S contains a point of S in its interior. This matches an earlier upper bound by Aichholzer et al. up to a multiplicative constant and answers another of their open problems.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

<a href="/cs/project/GA18-19158S" target="_blank" >GA18-19158S: Algoritmické, strukturální a složitostní aspekty geometrických a dalších konfigurací</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Combinatorial Algorithms

ISBN

978-3-030-25004-1

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

13

Strana od-do

35-47

Název nakladatele

Springer, Cham

Místo vydání

Neuveden

Místo konání akce

Itálie

Datum konání akce

23. 7. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—