Topological Drawings meet Classical Theorems from Convex Geometry

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bergold, Helena, Felsner, Stefan, Scheucher, Manfred, Schröder, Felix, Steiner, Raphael
Format: Preprint
Veröffentlicht: 2020
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909269863956480
author Bergold, Helena
Felsner, Stefan
Scheucher, Manfred
Schröder, Felix
Steiner, Raphael
author_facet Bergold, Helena
Felsner, Stefan
Scheucher, Manfred
Schröder, Felix
Steiner, Raphael
contents 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éodory's Theorem in the plane and discuss further classical theorems from Convex Geometry in the context of simple topological drawings.
format Preprint
id arxiv_https___arxiv_org_abs_2005_12568
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle Topological Drawings meet Classical Theorems from Convex Geometry
Bergold, Helena
Felsner, Stefan
Scheucher, Manfred
Schröder, Felix
Steiner, Raphael
Combinatorics
Computational Geometry
Discrete Mathematics
05C10, 52Cxx, 52A35
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éodory's Theorem in the plane and discuss further classical theorems from Convex Geometry in the context of simple topological drawings.
title Topological Drawings meet Classical Theorems from Convex Geometry
topic Combinatorics
Computational Geometry
Discrete Mathematics
05C10, 52Cxx, 52A35
url https://arxiv.org/abs/2005.12568