Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Tverberg's theorem says that a set with sufficiently many points in \(\mathbb{R}^d\) can always be partitioned into \(m\) parts so that the \((m-1)\)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results of our paper demonstrate that Tverberg's theo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-08
Hauptverfasser:	De Loera, Jesús A, Hogan, Thomas A, Oliveros, Deborah, Yang, Dominic
Format:	Artikel
Sprache:	eng
Schlagworte:	Convexity Hulls Theorems Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!