1.
Discrete Comput Geom
; 71(2): 683-687, 2024.
Article
in English
| MEDLINE
| ID: mdl-38318158
ABSTRACT
Ball's complex plank theorem states that if v1,â¯,vn are unit vectors in Cd, and t1,â¯,tn are non-negative numbers satisfying ∑k=1ntk2=1, then there exists a unit vector v in Cd for which |⟨vk,v⟩|≥tk for every k. Here we present a streamlined version of Ball's original proof.
