8 research outputs found
A Lower Bound on Opaque Sets
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 by Jones in 1964. A similar bound is proved for all convex sets U other than a triangle
A lower bound on opaque sets
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 by Jones in 1964. A similar bound is proved for all convex sets U other than a triangle. © Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, and János Pach
A lower bound on opaque sets
It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar bound is proved for all convex sets U other than a triangle. (C) 2019 Published by Elsevier B.V
Quadratic Crofton and sets that see themselves as little as possible
Let and let be a
one-dimensional set with finite length . We are interested in
minimizers of an energy functional that measures the size of a set projected
onto itself in all directions: we are thus asking for sets that see themselves
as little as possible (suitably interpreted). Obvious minimizers of the
functional are subsets of a straight line but this is only possible for L \leq
\mbox{diam}(\Omega). The problem has an equivalent formulation: the expected
number of intersections between a random line and depends only on
the length of (Crofton's formula). We are interested in sets
that minimize the variance of the expected number of
intersections. We solve the problem for convex and slightly less than
half of all values of : there, a minimizing set is the union of copies of
the boundary and a line segment
Errata and Addenda to Mathematical Constants
We humbly and briefly offer corrections and supplements to Mathematical
Constants (2003) and Mathematical Constants II (2019), both published by
Cambridge University Press. Comments are always welcome.Comment: 162 page
A lower bound on opaque sets
It is proved that the total length of any set of countably many rectifiable
curves, whose union meets all straight lines that intersect the unit square U,
is at least 2.00002. This is the first improvement on the lower bound of 2
established by Jones in 1964. A similar bound is proved for all convex sets U
other than a triangle.Comment: 13 pages, 10 figure