Thieves can make sandwiches

DOI10.1112/blms.12109zbMath1390.52008arXiv1706.03640OpenAlexW2625269800MaRDI QIDQ4604599

Pablo Soberón, Pavle V. M. Blagojević

Publication date: 2 March 2018

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

convex partitionsAlon's Necklace Splitting theoremFadell-Husseini ideal valued indexHam Sandwich theoremmeasure partition problemtopological join of two spaces

Mathematics Subject Classification ID

Partitions of sets (05A18) Other problems of combinatorial convexity (52A37) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Equivariant operations and obstructions in algebraic topology (55S91)

Related Items (6)

A survey of mass partitions ⋮ Fair Division and Generalizations of Sperner- and KKM-type Results ⋮ Few cuts meet many point sets ⋮ SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich

Cites Work

• Splitting necklaces
• Convex equipartitions via equivariant obstruction theory
• Splitting multidimensional necklaces
• Convex equipartitions: the spicy chicken theorem
• Measure partitions using hyperplanes with fixed directions
• BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ ^d
• Bisection of Circle Colorings
• An ideal-valued cohomological index theory with applications to Borsuk—Ulam and Bourgin—Yang theorems
• The Early History of the Ham Sandwich Theorem
• Fair Division and Generalizations of Sperner- and KKM-type Results
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• Equivariant topology of configuration spaces
• Fair Partitioning by Straight Lines
• A Moment Problem in L 1 Approximation

This page was built for publication: Thieves can make sandwiches