Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
96 tokens/sec
Gemini 2.5 Pro Premium
42 tokens/sec
GPT-5 Medium
20 tokens/sec
GPT-5 High Premium
27 tokens/sec
GPT-4o
100 tokens/sec
DeepSeek R1 via Azure Premium
86 tokens/sec
GPT OSS 120B via Groq Premium
464 tokens/sec
Kimi K2 via Groq Premium
181 tokens/sec
2000 character limit reached

Volume bounds for shadow covering (1109.1619v1)

Published 8 Sep 2011 in math.MG

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.