A generalization of Winternitz’s theorem and its discrete version
HTML articles powered by AMS MathViewer
- by Alexandra Shyntar and Vladyslav Yaskin PDF
- Proc. Amer. Math. Soc. 149 (2021), 3089-3104 Request permission
Abstract:
Let $K$ be a convex body in the plane. Cut $K$ by a line passing through its centroid. It is a well-known result, due to Winternitz, that the areas of the resulting two pieces are at least $4/9$ times the area of $K$ and at most $5/9$ times the area of $K$. We generalize this inequality to the case when the body is cut by a line not passing through the centroid. As an application we obtain a discrete version of Winternitz’s theorem.References
- Matthew Alexander, Martin Henk, and Artem Zvavitch, A discrete version of Koldobsky’s slicing inequality, Israel J. Math. 222 (2017), no. 1, 261–278. MR 3736506, DOI 10.1007/s11856-017-1589-5
- Matthias Beck and Sinai Robins, Computing the continuous discretely, Undergraduate Texts in Mathematics, Springer, New York, 2007. Integer-point enumeration in polyhedra. MR 2271992
- W. Blaschke, Vorlesungen über Differentialgeometrie. II, Affine Differentialgeometrie, Springer, Berlin, 1923.
- T. Bonnesen and W. Fenchel, Theory of convex bodies, BCS Associates, Moscow, ID, 1987. Translated from the German and edited by L. Boron, C. Christenson and B. Smith. MR 920366
- Matthieu Fradelizi, Mathieu Meyer, and Vlad Yaskin, On the volume of sections of a convex body by cones, Proc. Amer. Math. Soc. 145 (2017), no. 7, 3153–3164. MR 3637961, DOI 10.1090/proc/13457
- Richard J. Gardner, Geometric tomography, 2nd ed., Encyclopedia of Mathematics and its Applications, vol. 58, Cambridge University Press, New York, 2006. MR 2251886, DOI 10.1017/CBO9781107341029
- Richard J. Gardner, Paolo Gronchi, and Chuanming Zong, Sums, projections, and sections of lattice sets, and the discrete covariogram, Discrete Comput. Geom. 34 (2005), no. 3, 391–409. MR 2160045, DOI 10.1007/s00454-005-1169-z
- B. Grünbaum, Partitions of mass-distributions and of convex bodies by hyperplanes, Pacific J. Math. 10 (1960), 1257–1261. MR 124818
- Mathieu Meyer, Fedor Nazarov, Dmitry Ryabogin, and Vladyslav Yaskin, Grünbaum-type inequality for log-concave functions, Bull. Lond. Math. Soc. 50 (2018), no. 4, 745–752. MR 3870956, DOI 10.1112/blms.12175
- S. Myroshnychenko, M. Stephen, and N. Zhang, Grünbaum’s inequality for sections, J. Funct. Anal. 275 (2018), no. 9, 2516–2537. MR 3847478, DOI 10.1016/j.jfa.2018.04.001
- Dmitry Ryabogin, Vladyslav Yaskin, and Ning Zhang, Unique determination of convex lattice sets, Discrete Comput. Geom. 57 (2017), no. 3, 582–589. MR 3614773, DOI 10.1007/s00454-016-9823-1
- M. Stephen and N. Zhang, Grünbaum’s inequality for projections, J. Funct. Anal. 272 (2017), no. 6, 2628–2640. MR 3603308, DOI 10.1016/j.jfa.2016.09.009
- Ning Zhang, An analogue of the Aleksandrov projection theorem for convex lattice polygons, Proc. Amer. Math. Soc. 145 (2017), no. 6, 2305–2310. MR 3626490, DOI 10.1090/proc/13375
Additional Information
- Alexandra Shyntar
- Affiliation: University of Alberta, Edmonton, Alberta T6G 2G1, Canada
- Email: shyntar@ualberta.ca
- Vladyslav Yaskin
- Affiliation: Department of Mathematical & Statistical Sciences, University of Alberta, Edmonton, Alberta T6G 2G1, Canada
- MR Author ID: 650371
- Email: yaskin@ualberta.ca
- Received by editor(s): February 24, 2020
- Received by editor(s) in revised form: October 14, 2020
- Published electronically: April 7, 2021
- Additional Notes: The first author was supported by an NSERC USRA award. The second author was supported by an NSERC Discovery Grant.
- Communicated by: Deane Yang
- © Copyright 2021 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 149 (2021), 3089-3104
- MSC (2020): Primary 52A10, 52A40, 52C05
- DOI: https://doi.org/10.1090/proc/15465
- MathSciNet review: 4257817