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.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 175234583 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The Complex Plank Problem, Revisited. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ortega-Moreno%2C+Oscar%22">Ortega-Moreno, Oscar</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> oscarortem@gmail.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Discrete+%26+Computational+Geometry%22">Discrete & Computational Geometry</searchLink>. Mar2024, Vol. 71 Issue 2, p683-687. 5p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Discrete+geometry%22">Discrete geometry</searchLink><br /><searchLink fieldCode="DE" term="%22Functional+analysis%22">Functional analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=175234583 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s00454-022-00423-7 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 5 StartPage: 683 Subjects: – SubjectFull: Discrete geometry Type: general – SubjectFull: Functional analysis Type: general Titles: – TitleFull: The Complex Plank Problem, Revisited. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ortega-Moreno, Oscar IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 01795376 Numbering: – Type: volume Value: 71 – Type: issue Value: 2 Titles: – TitleFull: Discrete & Computational Geometry Type: main |
| ResultId | 1 |