No-dimensional Tverberg theorems and algorithms

DOI10.1007/S00454-022-00380-1MaRDI QIDQ2105318zbMATH OpenOpenAlexWikidataFDO

Authors Aruni Choudhary, Wolfgang Mulzer

Publication date 8 December 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

approximation algorithmTverberg theoremcolorful Carathéodory theorem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete geometry (52C99)

Recommendations

• No-dimensional Tverberg Theorems and Algorithms
• Approximating Tverberg points in linear time for any fixed dimension
• Approximating Tverberg points in linear time for any fixed dimension
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Algorithms for tolerated Tverberg partitions

Cites work

• A Colored Version of Tverberg's Theorem
• A Generalization of Radon's Theorem
• A Theorem on General Measure
• A generalization of Caratheodory's theorem
• A generalization of Radon's theorem II
• A geometric proof of the colored Tverberg theorem
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Algorithmic Game Theory
• An Extension of the Ham Sandwich Theorem
• Approximate centerpoints with proofs
• Approximating Tverberg points in linear time for any fixed dimension
• Colourful Linear Programming and its Relatives
• Computational aspects of the colorful Carathéodory theorem
• Generalized sandwich theorems
• Generalized ham-sandwich cuts
• Journey to the Center of the Point Set
• No-dimensional Tverberg Theorems and Algorithms
• On a generalization of the ham sandwich theorem
• On generalizations of Radon's theorem and the Ham sandwich theorem
• Optimal bounds for the colored Tverberg problem
• Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
• Slicing convex sets and measures by a hyperplane
• The colored Tverberg's problem and complexes of injective functions
• The complexity of splitting necklaces and bisecting ham sandwiches
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
• Theorems of Carathéodory, Helly, and Tverberg without dimension
• Tverberg's Theorem at 50: Extensions and Counterexamples
• Tverberg's theorem via number fields
• 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
• Very colorful theorems

Cited in

(2)

• No-dimensional Tverberg Theorems and Algorithms
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

This page was built for publication: No-dimensional Tverberg theorems and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105318)