Related papers: Packing Lines, Planes, etc.: Packings in Grassmann…
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…
A packing of disks in the plane is a set of disks with disjoint interiors. This paper is a survey of some open questions about such packings. It is organized into five themes: compacity, conjugacy, density, uniformity and computability.
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
In machine learning, data is usually represented in a (flat) Euclidean space where distances between points are along straight lines. Researchers have recently considered more exotic (non-Euclidean) Riemannian manifolds such as hyperbolic…
We consider the problem of recovering an unknown matching between a set of $n$ randomly placed points in $\mathbb{R}^d$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity…
Many real-world machine learning problems involve inherently hierarchical data, yet traditional approaches rely on Euclidean metrics that fail to capture the discrete, branching nature of hierarchical relationships. We present a theoretical…
Let $M$ be a complete, connected Riemannian surface and suppose that $\mathcal{S} \subset M$ is a discrete subset. What can we learn about $M$ from the knowledge of all distances in the surface between pairs of points of $\mathcal{S}$? We…
We study linear projections on Pluecker space whose restriction to the Grassmannian is a non-trivial branched cover. When an automorphism of the Grassmannian preserves the fibers, we show that the Grassmannian is necessarily of…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including…
On the Grassmann manifold G (m, n) of m-dimensional subspaces of an n-dimensional projective space P^n, a certain supplementary construction called the normalization is considered. By means of this normalization, one can construct the…
A vector space over a field $\mathbb{F}$ is a set $V$ together with two binary operations, called vector addition and scalar multiplication. It is standard practice to think of a Euclidean space $\mathbb{R}^n$ as an $n$-dimensional real…
Defining the $m$-th stratum of a closed subset of an $n$ dimensional Euclidean space to consist of those points, where it can be touched by a ball from at least $n-m$ linearly independent directions, we establish that the $m$-th stratum is…
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…
Learning well-separated features in high-dimensional spaces, such as text or image embeddings, is crucial for many machine learning applications. Achieving such separation can be effectively accomplished through the dispersion of…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
Subspace clustering is an important unsupervised clustering approach. It is based on the assumption that the high-dimensional data points are approximately distributed around several low-dimensional linear subspaces. The majority of the…
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…