Consider anm×N matrix Φ with the Restricted Isometry Property of order k and level δ, that is, the norm of any k-sparse vector in R is preserved to within a multiplicative factor of 1±δ under application of Φ. We show that by randomizing the column signs of such a matrix Φ, the resulting map with high probability embeds any fixed set of p = O(e) points in R into R without distorting the norm of...

We study extensions of compressive sensing and low rank matrix recovery (matrix completion) to the recovery of low rank tensors of higher order from a small number of linear measurements. While the theoretical understanding of low rank matrix recovery is already well-developed, only few contributions on the low rank tensor recovery problem are available so far. In this paper, we introduce versi...

Abstract The invariant Galton–Watson (IGW) tree measures are a one-parameter family of critical with respect to large class reduction operations. Such operations include the generalized dynamical pruning (also known as hereditary in real setting) that eliminates descendant subtrees according value an arbitrary subtree function is monotone nondecreasing isometry-induced partial order. We show th...

In this paper, we introduce the concepts of $2$-isometry, collinearity, $2$%-Lipschitz mapping in $2$-fuzzy $2$-normed linear spaces. Also, we give anew generalization of the Mazur-Ulam theorem when $X$ is a $2$-fuzzy $2$%-normed linear space or $Im (X)$ is a fuzzy $2$-normed linear space, thatis, the Mazur-Ulam theorem holds, when the $2$-isometry mapped to a $2$%-fuzzy $2$-normed linear space...

Due to the nature of multiplicative Rayleigh fading, symmetric space time block codes, and joint estimation and detection schemes, isometry (ambiguities in channel estimation and data detection) degrades MIMO system performances. Training breaks isometry but reduces capacity. Asymmetric space time block code mitigates isometry by replacing training with data-bearing asymmetric codewords. This p...

By local isometries we mean mappings which locally preserve distances. A few of the main results are: 1. For each local isometry / of a compact metric space (M,p) into itself there exists a unique decomposition of M into disjoint open sets, M = Ai g U • • • U Ai>, (0 < n < oo) such that (i) f(M}0) = M!Q, and (ii) f(M{) C M{_x and M< ^ 0 for each i, 1 < i < n. 2. Each local isometry of a metric ...

We develop a notion of a generalized Cuntz-Krieger family of projections and partial isometries where the range of the partial isometries need not have trivial intersection. We associate to these generalized Cuntz-Krieger families a directed graph, with a coloring function on the edge set. We call such a directed graph an edge-colored directed graph. We then study the C∗algebras and the non-sel...

For an $$n\times n$$ complex matrix C, the C-numerical range of a bounded linear operator T acting on Hilbert space dimension at least n is set numbers $$\textrm{tr}\,(CX\,^*\,TX)$$ , where X partial isometry satisfying $$X^*X = I_n$$ . It shown that $$\begin{aligned} \textbf{cl}(W_C(T)) \cap \{\textbf{cl}(W_C(U)): U \hbox { unitary dilation } T\} \end{aligned}$$ for any contraction if and only...

The aim of this paper is to show that the automorphism and isometry groups of the suspension of B(H), H being a separable infinite dimensional Hilbert space, are algebraically reflexive. This means that every local automorphism, respectively local surjective isometry of C0(R) ⊗ B(H) is an automorphism, respectively a surjective isometry.