No Arabic abstract
Within the class of reflexive Banach spaces, we prove a metric characterization of the class of asymptotic-$c_0$ spaces in terms of a bi-Lipschitz invariant which involves metrics that generalize the Hamming metric on $k$-subsets of $mathbb{N}$. We apply this characterization to show that the class of separable, reflexive, and asymptotic-$c_0$ Banach spaces is non-Borel co-analytic. Finally, we introduce a relaxation of the asymptotic-$c_0$ property, called the asymptotic-subsequential-$c_0$ property, which is a partial obstruction to the equi-coarse embeddability of the sequence of Hamming graphs. We present examples of spaces that are asymptotic-subsequential-$c_0$. In particular $T^*(T^*)$ is asymptotic-subsequential-$c_0$ where $T^*$ is Tsirelsons original space.
We study the embeddings of (homogeneous and inhomogeneous) anisotropic Besov spaces associated to an expansive matrix $A$ into Sobolev spaces, with focus on the influence of $A$ on the embedding behaviour. For a large range of parameters, we derive sharp characterizations of embeddings.
We consider a general notion of snowflake of a metric space by composing the distance by a nontrivial concave function. We prove that a snowflake of a metric space $X$ isometrically embeds into some finite-dimensional normed space if and only if $X$ is finite. In the case of power functions we give a uniform bound on the cardinality of $X$ depending only on the power exponent and the dimension of the vector space.
We consider one of the classical manifold learning problems, that of reconstructing up to an almost isometry an embedding of a compact connected Riemannian manifold in a Euclidean space given the information on intrinsic distances between points from its almost dense subset. It will be shown that the most popular methods in data science to deal with such a problem, the classical Multidimensional scaling (MDS) and the Maximum variance unfolding (MVU) actually miss the point and may provide results very far from an isometry (and even may give no biLipshitz embedding). We will then provide an easy variational formulation of this problem which leads to an algorithm always providing an almost isometric imbedding with given controlled small distortion of original distances.
The Lipschitz geometry of segments of the infinite Hamming cube is studied. Tight estimates on the distortion necessary to embed the segments into spaces of continuous functions on countable compact metric spaces are given. As an application, the first nontrivial lower bounds on the $C(K)$-distortion of important classes of separable Banach spaces, where $K$ is a countable compact space in the family $ { [0,omega],[0,omegacdot 2],dots, [0,omega^2], dots, [0,omega^kcdot n],dots,[0,omega^omega]} ,$ are obtained.
We prove that every isometry between two combinatorial spaces is determined by a permutation of the canonical unit basis combined with a change of signs. As a consequence, we show that in the case of Schreier spaces, all the isometries are given by a change of signs of the elements of the basis. Our results hold for both the real and the complex cases.