Volume bounds for shadow covering

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 3 figures

Scientific paper

For n >= 2 a construction is given for a large family of compact convex sets K and L in n-dimensional Euclidean space such that the orthogonal projection L_u onto the subspace u^\perp contains a translate of the corresponding projection K_u for every direction u, while the volumes of K and L satisfy V_n(K) > V_n(L). It is subsequently shown that, if the orthogonal projection L_u onto the subspace u^\perp contains a translate of K_u for every direction u, then the set (n/(n-1))L contains a translate of K. If follows that V_n(K) <= (n/(n-1))^n V_n(L). In particular, we derive a universal constant bound V_n(K) <= 2.942 V_n(L), independent of the dimension n of the ambient space. Related results are obtained for projections onto subspaces of some fixed intermediate co-dimension. Open questions and conjectures are also posed.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Volume bounds for shadow covering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Volume bounds for shadow covering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Volume bounds for shadow covering will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-474484

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.