Mesures vectorielles et partitions continues de l'unité
We develop several methods of realization of scalar product and generalized moment problems. Constructions are made by use of a Hilbertian method or a fixed point method. The constructed solutions are rational fractions and exponentials of polynomials. They are connected to entropy maximization. We give the general form of the maximizing solution. We show how it is deduced from the maximizing solution of the algebraic moment problem.
We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups.We compare characterizations of superrefiexivity in terms of diamond graphs and binary trees.We show that there exist sequences of series-parallel graphs of increasing topological complexitywhich admit uniformly bilipschitz embeddings into a Hilbert space, and thus do not characterize superrefiexivity.
An ellipse in R2 can be defined as the locus of points for which the sum of the Euclidean distances from the two foci is constant. In this paper we will look at the sets that are obtained by considering in the above definition distances induced by arbitrary norms.
We prove a number of results involving categories enriched over CMet, the category of complete metric spaces with possibly infinite distances. The category CPMet of path complete metric spaces is locally -presentable, closed monoidal, and coreflective in CMet. We also prove that the category CCMet of convex complete metric spaces is not closed monoidal and characterize the isometry--generated objects in CMet, CPMet and CCMet, answering questions by Di Liberti and Rosický. Other results include...
Let T be a precompact subset of a Hilbert space. We estimate the metric entropy of co(T), the convex hull of T, by quantities originating in the theory of majorizing measures. In a similar way, estimates of the Gelfand width are provided. As an application we get upper bounds for the entropy of co(T), , , by functions of the ’s only. This partially answers a question raised by K. Ball and A. Pajor (cf. [1]). Our estimates turn out to be optimal in the case of slowly decreasing sequences .
For a precompact subset K of a metric space and ε > 0, the covering number N(K,ε) is defined as the smallest number of balls of radius ε whose union covers K. Knowledge of the metric entropy, i.e., the asymptotic behaviour of covering numbers for (families of) metric spaces is important in many areas of mathematics (geometry, functional analysis, probability, coding theory, to name a few). In this paper we give asymptotically correct estimates for covering numbers for a large class of homogeneous...
In the first section of this paper there are given criteria for strict convexity and smoothness of the Bochner-Orlicz space with the Orlicz norm as well as the Luxemburg norm. In the second one that geometrical properties are applied to the characterization of metric projections and zero mean valued best approximants to Bochner-Orlicz spaces.
Let X be a closed subspace of c₀. We show that the metric projection onto any proximinal subspace of finite codimension in X is Hausdorff metric continuous, which, in particular, implies that it is both lower and upper Hausdorff semicontinuous.