The complex plank problem, revisited

DOI10.1007/S00454-022-00423-7arXiv2111.03961OpenAlexW3213950794WikidataQ114229288 ScholiaQ114229288MaRDI QIDQ6151034FDOQ6151034

Authors: Oscar Ortega-Moreno 

Publication date: 9 February 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Ball's complex plank theorem states that if $v_1,dots,v_n$ are unit vectors in $mathbb{C}^d$, and $t_1,dots,t_n$, non-negative numbers satisfying $su{m}_{k=1}^n{t}_k^2=1,$ then there exists a unit vector $v$ in $mathbb{C}^d$ for which $|langle{v}_k,vangle|geq{t}_k$ for every $k$. Here we present a streamlined version of Ball's original proof.

Full work available at URL: https://arxiv.org/abs/2111.03961

Recommendations

• THE COMPLEX PLANK PROBLEM
• The real plank problem and some applications
• Extensions of polynomial plank covering theorems
• An optimal plank theorem
• PLANK PROBLEMS, POLARIZATION AND CHEBYSHEV CONSTANTS

zbMATH Keywords

functional analysisdiscrete geometrycomplex geometrycovering problemsplank problems

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Inequalities and extremum problems in real or complex geometry (51M16) Discrete geometry (52C99)

Cites Work

• A Solution of the "Plank Problem"
• A Circle Covering Theorem
• The plank problem for symmetric bodies
• THE COMPLEX PLANK PROBLEM
• Exploring a Planet
• Proof of László Fejes Tóth's zone conjecture
• An optimal plank theorem
• Exploring a Planet, Revisited
• Covering by Planks and Avoiding Zeros of Polynomials

Cited In (1)

• Covering by Planks and Avoiding Zeros of Polynomials

This page was built for publication: The complex plank problem, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151034)