A uniform lower bound on the norms of hyperplane projections of spherical polytopes
Tomasz Kobos

TL;DR
This paper establishes a uniform lower bound on the norms of hyperplane projections of spherical polytopes, linking geometric properties to probabilistic bounds for random vertex configurations.
Contribution
It provides a novel lower bound on hyperplane projection norms for spherical polytopes with vertices forming a dense net, connecting geometric determinants to projection estimates.
Findings
Lower bound on projection norms in terms of vertex determinants
Probabilistic bounds for random spherical polytopes
Explicit constants for high-dimensional cases
Abstract
Let be a centrally symmetric spherical and simplicial polytope, whose vertices form a net in the unit sphere in . We prove a uniform lower bound on the norms of all hyperplane projections , where is the -dimensional normed space with the unit ball . The estimate is given in terms of the determinant function of vertices and faces of . In particular, if and , where are independent random points distributed uniformly in the unit sphere, then every hyperplane projection satisfies an inequality (for some explicit constant ), with the probability at least
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Analytic and geometric function theory
