Related papers: Distance Geometry for Kissing Spheres
We compute the area of a generic d-sphere in a Snyder geometry.
The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on…
The smallest hyperconvex metric space containing a given metric space X is called the tight span of X. It is known that tight spans have many nice geometric and topological properties, and they are gradually becoming a target of research of…
Quantum geometry defines the phase and amplitude distances between quantum states. The phase distance is characterized by the Berry curvature and thus relates to topological phenomena. The significance of the full quantum geometry,…
An algebraic formulation of Riemannian geometry on quantum spaces is presented, where Riemannian metric, distance, Laplacian, connection, and curvature have their counterparts. This description is also extended to complex manifolds.…
A distance-squared function is one of the most significant functions in the application of singularity theory to differential geometry. Moreover, distance-squared mappings are naturally extended mappings of distance-squared functions,…
We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…
We consider how flat a lattice simplex contained in the hypercube $[0,k]^d$ can be. This question is related to the notion of kissing polytopes: two lattice polytopes contained in the hypercube $[0,k]^d$ are kissing when they are disjoint…
We study the adhesion of an elastic sheet on a rigid spherical substrate. Gauss'Theorema Egregium shows that this operation necessarily generates metric distortions (i.e. stretching) as well as bending. As a result, a large variety of…
Physical geometry studies mutual disposition of geometrical objects and points in space, or space-time, which is described by the distance function $ d$, or by the world function $\sigma =d^{2}/2$. One suggests a new general method of the…
The paper introduces cycles cross ratio, which extends the classic cross ratio of four points to various settings: conformal geometry, Lie spheres geometry, etc. Just like its classic counterpart cycles cross ratio is a measure of…
A fundamental problem in spherical distance geometry aims to recover an $n$-tuple of points on a 2-sphere in $\mathbb{R}^3$, viewed up to oriented isometry, from $O(n)$ input measurements. We solve this problem using algorithms that employ…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
This paper establishes a rigorous geometrical framework for spherical origami, origami using spherical sheets based on spherical geometry. Two settings are treated: origami restricted to the unit sphere ($\mathbb{S}^2$), and…
This is an attempt to present axioms for Euclidean geometry, aiming at the following goals: to work with geometric notions (thus not merely identify points with pairs of numbers, giving a special status to a particular coordinate system);…
In this manuscript we study single-line approximations and fractals based on the Apollonian gasket. The well-known Apollonian gasket is the limit case of configurations of kissing circles. Rather than plotting the circles as discs on a…
We show that the Urysohn sphere is pseudofinite. As a consequence, we derive an approximate $0$-$1$ law for finite metric spaces of diameter at most $1$.
Physical geometry studies mutual disposition of geometrical objects and points in space, or space-time, which is described by the distance function d, or by the world function \sigma =d^{2}/2. One suggests a new general method of the…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…