Related papers: On the Matrices of Central Linear Mappings

The network embedding problem aims to map nodes that are similar to each other to vectors in a Euclidean space that are close to each other. Like centrality analysis (ranking) and community detection, network embedding is in general…

For every idempotent $Q$ on a Hilbert space $H$, the matched projection $m(Q)$ is a well-established concept. This paper explores several applications of the matched projections. The first application addresses the distances from…

The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…

A simple graph G is said to be representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two distinct vertices is one of only two distinct…

Given a monodromy representation $\rho$ of the projective line minus $m$ points, one can extend the resulting vector bundle with connection map canonically to a vector bundle with logarithmic connection map over all of the projective line.…

Let $(X,\left\Vert \cdot \right\Vert )$ be a real normed space of dimension $N\in \mathbb{N}$ with a basis $(e_{i})_{1}^{N}$ such that the norm is invariant under coordinate permutations. Assume for simplicity that the basis constant is at…

We prove a theorem on equivariant maps implying the following two corollaries: (1) Let N and M be compact orientable n-manifolds with boundaries such that M\subset N, the inclusion M\to N induces an isomorphism in integral cohomology, both…

This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…

Let X be a nonsingular simply connected projective variety of dimension m, E a rank n vector bundle on X, and L a line bundle on X. Suppose that $S^2(E^{*}) \otimes L$ is an ample vector bundle and that there is a constant even rank $r \ge…

In this paper we consider piecewise linear (pl) isometric embeddings of Euclidean polyhedra into Euclidean space. A Euclidean polyhedron is just a metric space $\mathcal{P}$ which admits a triangulation $\mathcal{T}$ such that each…

It is shown that each continuous transformation $h$ from Euclidean $m$-space ($m>1$) into Euclidean $n$-space that preserves the equality of distances (that is, fulfils the implication $|x-y|=|z-w|\Rightarrow|h(x)-h(y)|=|h(z)-h(w)|$) is a…

A typical linear projection of the Grassmannian in its Plucker embedding is injective, unless its image is a projective space. A notable exception are self-adjoint linear projections, which have even degree. We consider linear projections…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $z\not\in g(X)$, let $P_{2,1,m}(g,z)$ be the set of all lines $\Pi^1\subset\mathbb R^m$ containing $z$ such that $|g^{-1}(\Pi^1)|\geq 2$. We prove that for any $n$-dimensional metric…

Majority of the current dimensionality reduction or retrieval techniques rely on embedding the learned feature representations onto a computable metric space. Once the learned features are mapped, a distance metric aids the bridging of gaps…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

Let V be a variety in P^n(C) and let W be a linear space, of dimension w, in P^n. We say that V can be isomorphically projected onto W if there exists a linear projection f, from a suitable linear space L disjoint from W, dim(L) = n-w-1 >=…

In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…

CNN feature spaces can be linearly mapped and consequently are often interchangeable. This equivalence holds across variations in architectures, training datasets, and network tasks. Specifically, we mapped between 10 image-classification…