Tverberg plus minus

DOI10.1007/s00454-017-9960-1zbMath1401.52014arXiv1612.05630OpenAlexW2963657618MaRDI QIDQ1991341

Pablo Soberón, Imre Bárány

Publication date: 30 October 2018

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.05630

zbMATH Keywords

Tverberg's theoremsign conditions

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Other problems of combinatorial convexity (52A37)

Related Items

Plus minus analogues for affine Tverberg type results, Tverberg’s theorem is 50 years old: A survey, Strong independence and the dimension of a Tverberg set, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• Equal coefficients and tolerance in coloured Tverberg partitions
• A generalization of Caratheodory's theorem
• Tverberg's theorem via number fields
• A Colored Version of Tverberg's Theorem
• Radon partitions and a new notion of independence in affine and projective spaces
• Colourful Linear Programming and its Relatives
• A Generalization of Radon's Theorem
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler