Related papers: High-Dimensional Simplexes for Supermetric Search

The main difficulty in solving the Helmholtz equation within polygons is due to non-analytic vertices. By using a method nearly identical to that used by Fox, Henrici, and Moler in their 1967 paper; it is demonstrated that such eigenvalue…

We study the infimal value of the Hausdorff dimension of spaces that are H\"older equivalent to a given metric space; we call this bi-H\"older-invariant "H\"older dimension". This definition and some of our methods are analogous to those…

Embedding complex objects as vectors in low dimensional spaces is a longstanding problem in machine learning. We propose in this work an extension of that approach, which consists in embedding objects as elliptical probability…

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

We prove that subsets of ${\Bbb R}^d$, $d \ge 4$ of large enough Hausdorff dimensions contain vertices of an equilateral triangle. It is known that additional hypotheses are needed to assure the existence of equilateral triangles in two…

Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

For all $n \geq 2$, we construct a metric space $(X,d)$ and a quasisymmetric mapping $f\colon [0,1]^n \rightarrow X$ with the property that $f^{-1}$ is not absolutely continuous with respect to the Hausdorff $n$-measure on $X$. That is,…

We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…

Let $S = \{ {A_1},{A_2}, \cdots ,{A_n}\} $ be a finite point set in m-dimensional Euclidean space ${E^m}$, and$\left\| {{A_i}{A_j}} \right\|$ be the distance between $A_i$ and $A_j$. Define $\sigma (S) = \sum\limits_{1 \le i < j \le n}…

H. A. Hayden [1] introduced the idea of semi-symmetric non-metric connection on a Riemannian manifold in (1932). Agashe and Chafle \cite{1} defined and studied semi-symmetric non-metric connection on a Riemannian manifold. In the present…

In this paper, we study complete minimal hypersurfaces in Riemannian $n-$manifolds $\mathcal{M}^n$ for dimensions $4 \leq n \leq 7$, and we obtain some results in the spirit of known work for $n=3$. Key contributions include extending the…

Let $(\mathcal{M},g)$ be a Riemannian manifold and $\mathcal{N}$ a $\mathcal{C}^2$ submanifold without boundary. If we multiply the metric $g$ by the inverse of the squared distance to $\mathcal{N}$, we obtain a new metric structure on…

We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is…

We consider the problem of deciding whether a highly incomplete signal lies within a given subspace. This problem, Matched Subspace Detection, is a classical, well-studied problem when the signal is completely observed. High- dimensional…

Almost paracontact almost paracomplex Riemannian manifolds of the lowest dimension are studied. Such structures are constructed on hyperspheres in 4-dimensional spaces, Euclidean and pseudo-Euclidean, respectively. The obtained manifolds…

The distance metric plays an important role in nearest neighbor (NN) classification. Usually the Euclidean distance metric is assumed or a Mahalanobis distance metric is optimized to improve the NN performance. In this paper, we study the…

We prove an analogue of a theorem of A. Pollington and S. Velani ('05), furnishing an upper bound on the Hausdorff dimension of certain subsets of the set of very well intrinsically approximable points on a quadratic hypersurface. The proof…

We show some characterizations of hyperspheres in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$ with intrinsic and extrinsic properties such as the $n$-dimensional area of the sections cut off by hyperplanes, the…

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…