988 research outputs found
The hamburger theorem
We generalize the ham sandwich theorem to measures in as
follows. Let be absolutely continuous finite
Borel measures on . Let for , and assume that . Assume that for every . Then there
exists a hyperplane such that each open halfspace defined by
satisfies for every
and . As a
consequence we obtain that every -colored set of points in
such that no color is used for more than points can be
partitioned into disjoint rainbow -dimensional simplices.Comment: 11 pages, 2 figures; a new proof of Theorem 8, extended concluding
remark
Mass Partitions via Equivariant Sections of Stiefel Bundles
We consider a geometric combinatorial problem naturally associated to the
geometric topology of certain spherical space forms. Given a collection of
mass distributions on , the existence of affinely independent
regular -fans, each of which equipartitions each of the measures, can in
many cases be deduced from the existence of a -equivariant
section of the Stiefel bundle over , where
is the Stiefel manifold of all orthonormal -frames in
or , and
is the corresponding unit sphere. For example, the
parallelizability of when , or implies that any
two masses on can be simultaneously bisected by each of
pairwise-orthogonal hyperplanes, while when or 4, the triviality of the
circle bundle over the standard Lens Spaces
yields that for any mass on , there exist a pair of
complex orthogonal regular -fans, each of which equipartitions the mass.Comment: 11 pages, final versio
Recommended from our members
Dynamic ham-sandwich cuts in the plane
We design efficient data structures for dynamically maintaining a ham-sandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A ham-sandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our first data structure supports each operation in O(n1/3+ε) amortized time and O(n4/3+ε) space. Our second data structure performs faster when each point set decomposes into a small number k of subsets in convex position: it supports insertions and deletions in O(logn) time and ham-sandwich queries in O(klog4n) time. In addition, if each point set has convex peeling depth k , then we can maintain the decomposition automatically using O(klogn) time per insertion and deletion. Alternatively, we can view each convex point set as a convex polygon, and we show how to find a ham-sandwich cut that bisects the total areas or total perimeters of these polygons in O(klog4n) time plus the O((kb)polylog(kb)) time required to approximate the root of a polynomial of degree O(k) up to b bits of precision. We also show how to maintain a partition of the plane by two lines into four regions each containing a quarter of the total point count, area, or perimeter in polylogarithmic time.Engineering and Applied Science
Colorful Borsuk--Ulam theorems and applications
We prove a colorful generalization of the Borsuk--Ulam theorem and derive
colorful consequences from it, such as a colorful generalization of the ham
sandwich theorem. Even in the uncolored case this specializes to a
strengthening of the ham sandwich theorem, which given an additional condition,
contains a result of B\'{a}r\'{a}ny, Hubard, and Jer\'{o}nimo on well-separated
measures as a special case. We prove a colorful generalization of Fan's
antipodal sphere covering theorem, we derive a short proof of Gale's colorful
KKM theorem, and we prove a colorful generalization of Brouwer's fixed point
theorem. Our results also provide an alternative between Radon-type
intersection results and KKM-type covering results. Finally, we prove colorful
Borsuk--Ulam theorems for higher symmetry.Comment: 15 page
- …