The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
From MaRDI portal
Abstract: We discuss five discrete results: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carath'eodory, Helly, and Tverberg from combinatorial geometry. We explore their connections and emphasize their broad impact in application areas such as game theory, graph theory, mathematical optimization, computational geometry, etc.
Recommendations
- Quantitative Tverberg theorems over lattices and other discrete sets
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- A generalization of Carleman’s uniqueness theorem and a discrete Phragmén-Lindelöf theorem
- Tverberg theorems over discrete sets of points
- Discrete and lexicographic Helly-type theorems
- The discrete analog of the Malgrange-Ehrenpreis theorem
- scientific article; zbMATH DE number 1529642
- The discrete Kharitonov theorem revisited
- On a discrete version of a theorem of Clausen and its applications
Cites work
Too many MaRDI portal entities accessed. Number of entities loaded: 250/250.
Cited in
(60)- Intermediate value theorem for simplices for simplicial approximation of fixed points and zeros
- Different versions of the nerve theorem and colourful simplices
- A Tverberg type theorem for collectively unavoidable complexes
- Radon numbers and the fractional Helly theorem
- Function and colorful extensions of the KKM theorem
- Quantitative combinatorial geometry for concave functions
- The complexity of finding fair independent sets in cycles
- A type of algebraic structure related to sets of intervals
- Combinatorial convexity in Hadamard manifolds: existence for equilibrium problems
- No-dimensional Tverberg theorems and algorithms
- Functional John ellipsoids
- Isometric and affine copies of a set in volumetric Helly results
- Tolerance for colorful Tverberg partitions
- New lower bounds for Tverberg partitions with tolerance in the plane
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Colorful Helly-type theorems for the volume of intersections of convex bodies
- Regular polygonal partitions of a Tverberg type
- Quantitative fractional Helly and \((p,q)\)-theorems
- Envy-free cake division without assuming the players prefer nonempty pieces
- Matching points with disks with a common intersection
- Optimal ℓ 1 Rank One Matrix Decomposition
- Tverberg’s theorem is 50 years old: A survey
- Tverberg theorems over discrete sets of points
- Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
- A survey of mass partitions
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Helly-type problems
- Algorithms for Radon partitions with tolerance
- Combinatorial properties of nonarchimedean convex sets
- RELATIVE LERAY NUMBERS VIA SPECTRAL SEQUENCES
- Inscribed Tverberg‐type partitions for orbit polytopes
- A Tverberg type theorem for staircase convexity
- Couplings and matchings: combinatorial notes on Strassen's theorem
- Quantitative Helly-type theorems via hypergraph chains
- The topology of projective codes and the distribution of zeros of odd maps
- Some new results on geometric transversals
- The crossing Tverberg theorem
- Stabbing boxes with finitely many axis-parallel lines and flats
- Computational complexity of the -Ham-Sandwich problem
- A generalization of Grünbaum's inequality in \(\mathrm{RCD}(0, N)\)-spaces
- No-dimensional Tverberg partitions revisited
- An FPT algorithm for splitting a necklace among two thieves
- Beyond chromatic threshold via (p,q)-theorem, and blow-up phenomenon
- Colorful intersections and Tverberg partitions
- Eight-partitioning points in 3D, and efficiently too
- Pizza sharing is PPA-hard
- Colorful Borsuk-Ulam theorems and applications
- An FPT algorithm for splitting a necklace among two thieves
- Ky Fan theorem for sphere bundles
- Tverberg partition graphs
- The complexity of finding fair independent sets in cycles
- A combinatorial topology approach to Arrow's impossibility theorem
- A stepping-up lemma for topological set systems
- No-dimensional piercing of convex sets
- Unfairly splitting separable necklaces
- Hausdorff vs Gromov-Hausdorff distances
- No-dimensional Tverberg partitions revisited
- Eight-partitioning points in 3D, and efficiently too
- Intersection patterns in spaces with a forbidden homological minor
This page was built for publication: The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241224)
