Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-17T19:55:17.889Z Has data issue: false hasContentIssue false
  • English
  • Français

BALANCED CONVEX PARTITIONS OF MEASURES IN ℝd

Part of: Classical measure theory

Published online by Cambridge University Press:  21 October 2011

Pablo Soberón
Pablo Soberón*
Affiliation:
Department of Mathematics, University College London, Gower Sreet, London WC1E 6BT, U.K. (email: [email protected])
Get access

Abstract

We prove the following generalization of the ham sandwich theorem, conjectured by Imre Bárány. Given a positive integer k and d nice measures μ1,μ2,…,μd in ℝd such that μi(ℝd)=k for all i, there is a partition of ℝd into k interior-disjoint convex parts C1,C2,…,Ck such that μi (Cj)=1 for all i,j. If k=2 , this gives the ham sandwich theorem. This result was proved independently by R. N. Karasev.

MSC classification

Secondary: 28A75: Length, area, volume, other geometric measure theory
Type
Research Article
Information
Mathematika , Volume 58 , Issue 1 , January 2012 , pp. 71 - 76
Copyright
Copyright © University College London 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Aronov, B., Aurenhammer, F. and Hoffmann, F., Minkowski-type theorems and least-squares clustering. Algoritmica 20(1) (1998), 61–76.Google Scholar
[2]Aronov, B. and Hubard, A., Convex equipartition of volume and surface area. Preprint, 2010, arXiv:1010.4611v1.Google Scholar
[3]Bespamyatnikh, S., Kirkpatrick, D. and Snoeyink, J., Generalizing ham sandwich cuts to equitable subdivisions. Discrete Computat. Geom. 24(4) (2000), 605–622.CrossRefGoogle Scholar
[4]Beyer, W. A. and Zardecki, A., The early history of the ham sandwich theorem. Amer. Math. Monthly 111(1) (2004), 58–61.CrossRefGoogle Scholar
[5]Carlsson, J. G., Armbruster, B. and Ye, Y., Finding equitable convex partitions of points in a polygon efficiently. ACM Trans. Algorithms 6(4) (2010), 1–19.CrossRefGoogle Scholar
[6]Dold, A., Simple proofs of some Borsuk–Ulam results. Contemp. Math. 19 (1983), 65–69.CrossRefGoogle Scholar
[7]Karasev, R. N., Equipartition of several measures. Preprint, 2010, arXiv:1011.4762v4.Google Scholar
[8]Matoušek, J., Using the Borsuk–Ulam theorem, Springer (Berlin, 2003).Google Scholar
[9]Sakai, T., Balanced convex partitions of measures in ℝ2. Graphs and Comb. 18(1) (2002), 169–192.CrossRefGoogle Scholar