Computation of maximal projection constants
Abstract
The linear projection constant (E) of a finite-dimensional real Banach space E is the smallest number C∈ [0,+∞) such that E is a C-absolute retract in the category of real Banach spaces with bounded linear maps. We denote by n the maximal linear projection constant amongst n-dimensional Banach spaces. In this article, we prove that n may be determined by computing eigenvalues of certain two-graphs. From this result we obtain that the relative projection constants of codimension n converge to 1+n. Furthermore, using the classification of K4-free two-graphs, we give an alternative proof of 2=43. We also show by means of elementary functional analysis that for each integer n≥ 1 there exists a polyhedral n-dimensional Banach space Fn such that (Fn)=n.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.