On the Volume of Boolean Expressions of Large Congruent Balls

Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 234)

Abstract

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the d-dimensional Euclidean space. When the radius r of the balls is large, this volume can be approximated by a polynomial of r, which will be computed up to an \(O(r^{d-3})\) error term. We study how the top coefficients of this polynomial depend on the set of the centers. It is known that in the case of the union of the balls, the top coefficients are some constant multiples of the intrinsic volumes of the convex hull of the centers. Thus, the coefficients in the general case lead to generalizations of the intrinsic volumes, in particular, to a generalization of the mean width of a set. Some known results on the mean width, along with the theorem on its monotonicity under contractions are extended to the “Boolean analogues” of the mean width.

Keywords

Volume Intrinsic volume Quermassintegral Unions and intersections of balls 

Notes

Acknowledgements

This research was supported by the Hungarian National Science and Research Foundation OTKA K 112703. Part of the research was done in the academic year 2014/15, while the author enjoyed the hospitality of the MTA Alfréd Rényi Institute of Mathematics as a guest researcher.

References

  1. 1.
    K. Bezdek, Private communication. Retrospective Workshop on Discrete Geometry, Optimization, and Symmetry, The Fields Institute, Toronto, November 25–29, 2013Google Scholar
  2. 2.
    K. Bezdek, R. Connelly, Pushing disks apart–the Kneser-Poulsen conjecture in the plane. J. Reine Angew. Math. 553, 221–236 (2002).  https://doi.org/10.1515/crll.2002.101MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    V. Capoyleas, J. Pach, On the perimeter of a point set in the plane, in Discrete and computational geometry (New Brunswick, NJ, 1989/1990), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 6 (Amer. Math. Soc., Providence, RI, 1991), pp. 67–76Google Scholar
  4. 4.
    B. Csikós, On the volume of flowers in space forms. Geom. Dedicata 86(1–3), 59–79 (2001).  https://doi.org/10.1023/A:1011983123985MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    B. Csikós, A Schläfli-type formula for polytopes with curved faces and its application to the Kneser-Poulsen conjecture. Monatsh. Math. 147(4), 273–292 (2006).  https://doi.org/10.1007/s00605-005-0363-7MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    S. Givant, P. Halmos, Introduction to Boolean algebras, in Undergraduate Texts in Mathematics (Springer, New York, 2009).  https://doi.org/10.1007/978-0-387-68436-9
  7. 7.
    I. Gorbovickis, Strict Kneser-Poulsen conjecture for large radii. Geom. Dedicata 162, 95–107 (2013).  https://doi.org/10.1007/s10711-012-9718-0MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Y. Gordon, M. Meyer, On the volume of unions and intersections of balls in Euclidean space, in Geometric aspects of functional analysis (Israel, 1992–1994), Oper. Theory Adv. Appl., vol. 77 (Birkhäuser, Basel, 1995), pp. 91–101CrossRefGoogle Scholar
  9. 9.
    M. Gromov, Monotonicity of the volume of intersection of balls, in Geometrical aspects of functional analysis (1985/86), Lecture Notes in Math., vol. 1267 (Springer, Berlin, 1987), pp. 1–4.  https://doi.org/10.1007/BFb0078131Google Scholar
  10. 10.
    M. Kneser, Einige Bemerkungen über das Minkowskische Flächenmass. Arch. Math. (Basel) 6, 382–390 (1955)MathSciNetCrossRefGoogle Scholar
  11. 11.
    E.T. Poulsen, Problem 10. Math. Scandinavica 2, 346 (1954)Google Scholar
  12. 12.
    R. Schneider, Convex bodies: the Brunn-Minkowski theory, in Encyclopedia of Mathematics and its Applications, vol. 151, expanded edn. (Cambridge University Press, Cambridge, 2014)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Institute of MathematicsEötvös Loránd UniversityBudapestHungary
  2. 2.BudapestHungary

Personalised recommendations