The number of tangencies between two families of curves

preprint2022arXivOpen access

Abstract

We prove that the number of tangencies between the members of two families, each of which consists of nn pairwise disjoint curves, can be as large as Ω(n4/3)Ω(n^{4/3}). We show that from a conjecture about forbidden 00-11 matrices it would follow that this bound is sharp for doubly-grounded families. We also show that if the curves are required to be xx-monotone, then the maximum number of tangencies is Θ(nlog⁡n)Θ(n\log n), which improves a result by Pach, Suk, and Treml. Finally, we also improve the best known bound on the number of tangencies between the members of a family of at most tt-intersecting curves.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.