The Complex Plank Problem, Revisited.
Saved in:
| Title: | The Complex Plank Problem, Revisited. |
|---|---|
| Authors: | Ortega-Moreno, Oscar1 (AUTHOR) oscarortem@gmail.com |
| Source: | Discrete & Computational Geometry. Mar2024, Vol. 71 Issue 2, p683-687. 5p. |
| Subjects: | Discrete geometry, Functional analysis |
| Abstract: | Ball's complex plank theorem states that if v 1 , ⋯ , v n are unit vectors in C d , and t 1 , ⋯ , t n are non-negative numbers satisfying ∑ k = 1 n t k 2 = 1 , then there exists a unit vector v in C d for which | ⟨ v k , v ⟩ | ≥ t k for every k. Here we present a streamlined version of Ball's original proof. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Ball's complex plank theorem states that if v 1 , ⋯ , v n are unit vectors in C d , and t 1 , ⋯ , t n are non-negative numbers satisfying ∑ k = 1 n t k 2 = 1 , then there exists a unit vector v in C d for which | ⟨ v k , v ⟩ | ≥ t k for every k. Here we present a streamlined version of Ball's original proof. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 01795376 |
| DOI: | 10.1007/s00454-022-00423-7 |
