The complex plank problem, revisited

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

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 $sum_{k=1}^nt_k^2 = 1,$ then there exists a unit vector $v$ in $mathbb{C}^d$ for which $|langle v_k,v angle | 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

zbMATH Keywords

complex geometrydiscrete geometryfunctional analysiscovering problemsplank problems

Mathematics Subject Classification ID

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

Cites Work

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

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