A survey of mass partitions
DOI10.1090/bull/1725zbMath1505.55005arXiv2010.00478OpenAlexW3132091864MaRDI QIDQ5067418
Pablo Soberón, Edgardo Roldán-Pensado
Publication date: 1 April 2022
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.00478
surveyhyperplanesham sandwich theoremdiscretecontinuousBorsuk-Ulamconvex partitionsmass partition problems
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Length, area, volume, other geometric measure theory (28A75) Fixed points and coincidences in algebraic topology (55M20) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Research exposition (monographs, survey articles) pertaining to algebraic topology (55-02)
Related Items (4)
Cites Work
- Hyperplane mass partitions via relative equivariant obstruction theory
- On equidissection of balanced polygons
- Computing generalized ham-sandwich cuts
- An incidence theorem in higher dimensions
- Balanced partitions of 3-colored geometric sets in the plane
- Illumination complexes, \(\varDelta\)-zonotopes, and the polyhedral curtain theorem
- On the Erdős distinct distances problem in the plane
- Dissecting the square into five congruent parts
- On a conjecture of Grünbaum concerning partitions of convex sets
- Generalized ham-sandwich cuts
- A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
- A deterministic view of random sampling and its use in geometry
- A ham sandwich theorem for general measures
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Stabbing simplices by points and flats
- Equipartition of a measure by \((Z_{p})^{k}\)-invariant fans
- Topology and combinatorics of partitions of masses by hyperplanes
- Geodesic ham-sandwich cuts
- Algorithms for fair partitioning of convex polygons
- Measure equipartitions via finite Fourier analysis
- Construction of \(\epsilon\)-nets
- Combinatorial complexity bounds for arrangements of curves and spheres
- Necklace bisection with one cut less than needed
- On the Yao-Yao partition theorem
- Dynamic ham-sandwich cuts in the plane
- Equipartitioning by a convex 3-fan
- Non-partitionable point sets
- Fair division of a measurable space
- Sets on which several measures agree
- \(\epsilon\)-nets and simplex range queries
- Splitting necklaces
- Dissections of regular polygons into triangles of equal areas
- Points and triangles in the plane and halving planes in space
- Bisections and ham-sandwich cuts of convex polygons and polyhedra
- A linear algorithm for bisecting a polygon
- Efficient partition trees
- The colored Tverberg's problem and complexes of injective functions
- A generalization of the ham sandwich theorem
- An equipartition of planar sets
- Cutting hyperplanes for divide-and-conquer
- On generalizations of Radon's theorem and the Ham sandwich theorem
- Trisecting a rectangle
- On the expected number of \(k\)-sets
- On the complexity of the parity argument and other inefficient proofs of existence
- Algorithms for ham-sandwich cuts
- Balanced convex partitions of measures in \(\mathbb R^{2}\)
- Cutting dense point sets in half
- Generalized Sperner lemma and subdivisions into simplices of equal volume
- Minkowski-type theorems and least-squares clustering
- A positive fraction Erdős-Szekeres theorem
- Improved bounds for planar \(k\)-sets and related problems
- Isoperimetry of waists and concentration of maps
- Generalizing ham sandwich cuts to equitable subdivisions
- Equipartition of two measures by a 4-fan
- Hyperplane equipartitions plus constraints
- The hamburger theorem
- Computing balanced islands in two colored point sets in the plane
- Convex equipartitions of colored point sets
- The ham sandwich theorem revisited
- The partitioned version of the Erdős-Szekeres theorem
- Equipartition of mass distributions by hyperplanes
- A center transversal theorem for hyperplanes and applications to graph drawing
- Cutting the same fraction of several measures
- Functions, measures, and equipartitioning convex \(k\)-fans
- Convex equipartitions via equivariant obstruction theory
- More bisections by hyperplane arrangements
- Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
- Borsuk-Ulam theorems for products of spheres and Stiefel manifolds revisited
- Dense point sets with many halving lines
- Ham-sandwich cuts and center transversals in subspaces
- Bisecting three classes of lines
- Balanced convex partitions of lines in the plane
- An extension of a theorem of Yao and Yao
- Sharp estimates for oscillatory integral operators via polynomial partitioning
- Another ham sandwich in the plane
- Splitting a configuration in a simplex
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Combinatorial necklace splitting
- Near equipartitions of colored point sets
- A sharp Schrödinger maximal estimate in \(\mathbb{R}^2\)
- Spaces of convex \(n\)-partitions
- Splitting multidimensional necklaces
- Simplotopal maps and necklace splitting
- Convex equipartitions: the spicy chicken theorem
- Slicing convex sets and measures by a hyperplane
- Equipartitions of measures by 2-fans
- Equitable subdivisions within polygonal regions
- Theorems on equipartition of a continuous mass distribution
- Simultane Vierteilung zweier Körper
- Measure partitions using hyperplanes with fixed directions
- On the number of halving planes
- Using equivariant obstruction theory in combinatorial geometry
- Generalized sandwich theorems
- Discrete geometry on colored point sets in the plane -- a survey
- Rental Harmony: Sperner's Lemma in Fair Division
- A restriction estimate using polynomial partitioning
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- Obstacles for splitting multidimensional necklaces
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
- An Improved Bound for k-Sets in Four Dimensions
- BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ d
- Discrete Splittings of the Necklace
- Ramsey-type results for semi-algebraic relations
- Bisection of Circle Colorings
- Equipartition of convex bodies
- An Extension of the Ham Sandwich Theorem
- Splitting necklaces and measurable colorings of the real line
- Topological methods in combinatorial geometry
- Simple proofs of some Borsuk-Ulam results
- Partitioning with two lines in the plane
- An ideal-valued cohomological index theory with applications to Borsuk—Ulam and Bourgin—Yang theorems
- Partitioning Space for Range Queries
- Dissection of the Hypercube into Simplexes
- Polygon Retrieval
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Point Selections and Weak ε-Nets for Convex Hulls
- The Floodlight Problem
- The Early History of the Ham Sandwich Theorem
- Ham Sandwich is Equivalent to Borsuk-Ulam
- Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem
- Gerrymandering, Sandwiches, and Topology
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Thieves can make sandwiches
- Fair Division and Generalizations of Sperner- and KKM-type Results
- Tverberg’s theorem is 50 years old: A survey
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- Bisecting measures with hyperplane arrangements
- Splitting Necklaces, with Constraints
- Cake Cutting Algorithms
- The complexity of splitting necklaces and bisecting ham sandwiches
- CUTTING A PART FROM MANY MEASURES
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- A problem related to Bárány-Grünbaum conjecture
- Fair Partitioning by Straight Lines
- An improved bound for k -sets in three dimensions
- Weighted Ham-Sandwich Cuts
- A Moment Problem in L 1 Approximation
- A Dissection Problem
- On Dividing a Square Into Triangles
- Sur la division des ensembles de l'espace par les plans et des ensembles plans par les cercles
- A Theorem on General Measure
- The classes PPA-\(k\): existence from arguments modulo \(k\)
- Discrete and Computational Geometry
- 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
- Simultaneous partitions of measures by \(k\)-fans
- Conical equipartitions of mass distributions
- Point sets with many \(k\)-sets
- Knaster's problem for \((\mathbb Z _{2})^{k }\)-symmetric subsets of the sphere \(S^{2^{k}-1}\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey of mass partitions