arXivDaily arXiv每日学术速递 周一至周五更新
今晚才能更新了~~大家休息下再来吧
arXiv math/9804023math.MG
收藏

Another low-technology estimate in convex geometry

Greg Kuperberg

英文摘要:

We give a short argument that for some C > 0, every n-dimensional Banach ball K admits a 256-round subquotient of dimension at least C n/(log n). This is a weak version of Milman's quotient of subspace theorem, which lacks the logarithmic factor.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑