Non-homotopic Loops with a Bounded Number of Pairwise Intersections

08/31/2021
by   Václav Blažej, et al.
0

Let V_n be a set of n points in the plane and let x ∉ V_n. An x-loop is a continuous closed curve not containing any point of V_n. We say that two x-loops are non-homotopic if they cannot be transformed continuously into each other without passing through a point of V_n. For n=2, we give an upper bound e^O(√(k)) on the maximum size of a family of pairwise non-homotopic x-loops such that every loop has fewer than k self-intersections and any two loops have fewer than k intersections. The exponent O(√(k)) is asymptotically tight. The previous upper bound bound 2^(2k)^4 was proved by Pach, Tardos, and Tóth [Graph Drawing 2020]. We prove the above result by proving the asymptotic upper bound e^O(√(k)) for a similar problem when x ∈ V_n, and by proving a close relation between the two problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

Upper bound for the number of privileged words

A non-empty word w is a border of a word u if | w|<| u| and w is both a ...
research
07/22/2020

Light Euclidean Spanners with Steiner Points

The FOCS'19 paper of Le and Solomon, culminating a long line of research...
research
11/25/2019

Upper bound for the number of closed and privileged words

A non-empty word w is a border of the word u if | w|<| u| and w is both ...
research
10/02/2022

No Selection Lemma for Empty Triangles

Let S be a set of n points in general position in the plane. The Second ...
research
06/21/2017

Art Gallery Localization

We study the problem of placing a set T of broadcast towers in a simple ...
research
07/28/2018

An upper bound for min-max angle of polygons

Let S be a set of points in the plane, CH be the convex hull of S, (S) b...
research
09/21/2022

The Upper Bound for the Lebesgue Constant for Lagrange Interpolation in Equally Spaced Points of the Triangle

An upper bound for the Lebesgue constant (the supremum norm) of the oper...

Please sign up or login with your details

Forgot password? Click here to reset