Papers
Topics
Authors
Recent
2000 character limit reached

Topological Drawings meet Classical Theorems from Convex Geometry

Published 26 May 2020 in math.CO, cs.CG, and cs.DM | (2005.12568v4)

Abstract: In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex or a point where they cross. Triangles of simple topological drawings can be viewed as convex sets. This gives a link to convex geometry. As our main result, we present a generalization of Kirchberger's Theorem that is of purely combinatorial nature. It turned out that this classical theorem also applies to "generalized signotopes" - a combinatorial generalization of simple topological drawings, which we introduce and investigate in the course of this article. As indicated by the name they are a generalization of signotopes, a structure studied in the context of encodings for arrangements of pseudolines. We also present a family of simple topological drawings with arbitrarily large Helly number, and a new proof of a topological generalization of Carath\'{e}odory's Theorem in the plane and discuss further classical theorems from Convex Geometry in the context of simple topological drawings.

Citations (8)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.