Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

Some Characterizations of Ergodic Probability Measures

Let P be a Markov kernel defined on a measurable space (X, ??). A P-ergodic probability is an extreme point of the family of all P-invariant probability measures on ??. Several characterizations of P-ergodic probabilities are given. In particular, for the special case of a topological space X both P-ergodic Baire probabilities and P-ergodic Borel probabilities with additional regularity properties are characterized.     

Multiple Wavelength Extinction Technique for Particle Characterization in Dense Particle Clouds

In utilizing the advantages of extinction measurements in micron and especially submicron particle characterization, the properties of a multiple wavelength extinction technique have been the subject of extended theoretical studies. Furthermore, an experimental set-up was designed which provides high flexibility owing to its modular design. The performance of the technique described is demonstrated by a large variety of applications in aerosol and combustion research and in large-scale industrial systems. It was found to be a reliable tool in characterizing dense particulate systems.     

Orbifold fibrations of Eschenburg spaces

Most of the few known examples of compact Riemannian manifolds with positive sectional curvature are the total space of a Riemannian submersion. In this article we show that this is true for all known examples, if we enlarge the category to orbifold fibrations. For this purpose we study all almost free isometric circle actions on positively curved Eschenburg spaces, which give rise to principle orbifold bundle structures, and we examine in detail their geometric properties. In particular, we obtain a new family of 6-dimensional orbifolds with positive sectional curvature whose singular locus consists of just two points.      

Aufschlu? von Zinn(IV)-oxid

Ohne Zusammenfassung

---

Decomposition of tin(IV) oxide

     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.