A simple proof of the Grunbaum conjecture
Beata Deregowska, Barbara Lewandowska

TL;DR
This paper introduces a new upper bound for the maximal absolute projection constant in subspaces, providing exact values in many cases, and simplifies existing proofs related to the Grunbaum conjecture.
Contribution
It offers a simplified proof and an upper bound for the projection constant, extending known results and solving cases previously considered difficult.
Findings
Provides an exact value for many cases of the projection constant
Simplifies proofs of previous results
Introduces an upper bound that matches known values in several instances
Abstract
Let denote the maximal absolute projection constant over the subspaces of dimension . Apart from the trivial case for , the only known value of is for and In 1960, B.Grunbaum conjectured that and in 2010, B. Chalmers and G. Lewicki proved it. In 2019, G. Basso delivered the alternative proof of this conjecture. Both proofs are quite complicated, and there was a strong belief that providing an exact value for in other cases will be a tough task. In our paper, we present an upper bound of the value , which becomes an exact value for the numerous cases. The crucial will be combining some results from the articles [B. Bukh, C. Cox, Nearly orthogonal vectors and small antipodal spherical codes, Isr. J. Math. 238, 359-388…
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
TopicsMathematics and Applications · Point processes and geometric inequalities · Computational Geometry and Mesh Generation
