Kovner–Besicovitch measure

In plane geometry the Kovner–Besicovitch measure is a number defined for any bounded convex set describing how close to being centrally symmetric it is. It is the fraction of the area of the set that can be covered by its largest centrally symmetric subset.^[1]

Properties

This measure is one for a set that is centrally symmetric, and less than one for sets whose closure is not centrally symmetric. It is invariant under affine transformations of the plane. If $c$ is the center of symmetry of the largest centrally-symmetric set within a given convex body $K$ , then the centrally-symmetric set itself is the intersection of $K$ with its reflection across $c$ .^[1]

Minimizers

The convex sets with the smallest possible Kovner–Besicovitch measure are the triangles, for which the measure is 2/3. The result that triangles are the minimizers of this measure is known as Kovner's theorem or the Kovner–Besicovitch theorem, and the inequality bounding the measure above 2/3 for all convex sets is the Kovner–Besicovitch inequality.^[2] The curve of constant width with the smallest possible Kovner–Besicovitch measure is the Reuleaux triangle.^[3]

Computational complexity

The Kovner–Besicovitch measure of any given convex polygon with $n$ vertices can be found in time $O(n\log n)$ by determining a translation of the reflection of the polygon that has the largest possible overlap with the unreflected polygon.^[4]

History

Branko Grünbaum writes that the Kovner–Besicovitch theorem was first published in Russian, in a 1935 textbook on the calculus of variations by Mikhail Lavrentyev and Lazar Lyusternik, where it was credited to Soviet mathematician and geophysicist S. S. Kovner [ru]. Additional proofs were given by Abram Samoilovitch Besicovitch and by István Fáry, who also proved that every minimizer of the Kovner–Besicovitch measure is a triangle.^[1]

References

^ ^a ^b ^c Grünbaum, Branko (1963), "Measures of symmetry for convex sets", in Klee, Victor L. (ed.), Convexity, Proceedings of Symposia in Pure Mathematics, vol. 7, Providence, Rhode Island: American Mathematical Society, pp. 233–270, MR 0156259
^ Makeev, V. V. (2007), "Some extremal problems for vector bundles", St. Petersburg Mathematical Journal, 19 (2): 131–155, doi:10.1090/S1061-0022-08-00998-9, MR 2333901
^ Finch, Steven R. (2003), "8.10 Reuleaux Triangle Constants" (PDF), Mathematical Constants, Encyclopedia of Mathematics and its Applications, Cambridge University Press, pp. 513–514, ISBN 978-0-521-81805-6.
^ de Berg, M.; Cheong, O.; Devillers, O.; van Kreveld, M.; Teillaud, M. (1998), "Computing the maximum overlap of two convex polygons under translations" (PDF), Theory of Computing Systems, 31 (5): 613–628, doi:10.1007/PL00005845, MR 1640323, S2CID 7193951

External links

A Measure of Central Symmetry, Tanya Khovanova's Math Blog, September 2, 2012

[grunbaum-1] Grünbaum, Branko (1963), "Measures of symmetry for convex sets", in Klee, Victor L. (ed.), Convexity, Proceedings of Symposia in Pure Mathematics, vol. 7, Providence, Rhode Island: American Mathematical Society, pp. 233–270, MR 0156259

[makaev-2] Makeev, V. V. (2007), "Some extremal problems for vector bundles", St. Petersburg Mathematical Journal, 19 (2): 131–155, doi:10.1090/S1061-0022-08-00998-9, MR 2333901

[finch-3] Finch, Steven R. (2003), "8.10 Reuleaux Triangle Constants" (PDF), Mathematical Constants, Encyclopedia of Mathematics and its Applications, Cambridge University Press, pp. 513–514, ISBN 978-0-521-81805-6.

[bcdkt-4] Berg, M.; Cheong, O.; Devillers, O.; van Kreveld, M.; Teillaud, M. (1998), "Computing the maximum overlap of two convex polygons under translations" (PDF), Theory of Computing Systems, 31 (5): 613–628, doi:10.1007/PL00005845, MR 1640323, S2CID 7193951

[1]

[2]

[3]

[4]