Minimal Projections and Absolute Projection Constants for Regular Polyhedral Spaces
نویسندگان
چکیده
Let V« [vx,...,vn] be the «-dimensional space of coordinate functions on a set of points ¡cR" where v is the set of vertices of a regular convex polyhedron. In this paper the absolute projection constant of any «-dimensional Banach space E isometrically isomorphic to V c C(v) is computed, examples of which are the well-known cases E = ITM, lln.
منابع مشابه
Norms of Minimal Projections
It is proved that the projection constants of twoand three-dimensional spaces are bounded by 4/3 and (1 + √ 5)/2, respectively. These bounds are attained precisely by the spaces whose unit balls are the regular hexagon and dodecahedron. In fact, a general inequality for the projection constant of a real or complex n-dimensional space is obtained and the question of equality therein is discussed...
متن کاملExtending Lipschitz Maps into C ( K ) - Spaces
We show that if K is a compact metric space then C(K) is a 2-absolute Lipschitz retract. We then study the best Lipschitz extension constants for maps into C(K) from a given metric space M , extending recent results of Lancien and Randrianantoanina. They showed that a finitedimensional normed space which is polyhedral has the isometric extension property for C(K)-spaces; here we show that the s...
متن کاملKhalil MINIMAL PROJECTIONS IN TENSOR PRODUCT SPACES
It is the object of this paper to study the existence and the form of minimal projections in some spaces of tensor products of Banach spaces. We answer a question of Franchetti and Cheney for finitely codimensional subspaces in C(K ) [1].
متن کاملA model based, anatomy dependent method for ultra-fast creation of primary SPECT projections
Introduction: Monte Carlo (MC) is the most common method for simulating virtual SPECT projections. It is useful for optimizing procedures, evaluating correction algorithms and more recently image reconstruction as a forward projector in iterative algorithms; however, the main drawback of MC is its long run time. We introduced a model based method considering the eff...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کامل