Distance geometry for kissing spheres (Q2348019): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5826272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by matrices positive semidefinite on a subspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isometric Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Euclidean and non-Euclidean distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lie sphere geometry. With applications to submanifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMBINATORIAL YAMABE FLOW ON SURFACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformally Flat Riemannian Manifolds as Hypersurfaces of the Light Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean decompositions of noncompact hyperbolic manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average kissing numbers for non-congruent sphere packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: LACK OF SPHERE PACKING OF GRAPHS VIA NONLINEAR POTENTIAL THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial scalar curvature and rigidity of ball packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators for sphere-packings and nearest neighbor graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal ball and horoball packings of the Coxeter tilings in the hyperbolic 3-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal ball and horoball packings to the Coxeter honeycombs in the hyperbolic \(d\)-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sphere packings and hyperbolic reflection groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gram matrix analysis of finite distance spaces in constant curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of infinite sphere packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lorentzian Coxeter systems and Boyd-Maxwell ball packings / rank
 
Normal rank

Latest revision as of 04:39, 10 July 2024

scientific article
Language Label Description Also known as
English
Distance geometry for kissing spheres
scientific article

    Statements

    Distance geometry for kissing spheres (English)
    0 references
    0 references
    10 June 2015
    0 references
    Let \(I\) be a set and \(d: I \times I \to \mathbb R_{\geq 0}\) a non-negative function such that \(d(i, j) = d(j, i)\) and \(d(i, i) =0\) for all \(i\), \(j \in I\). Then \((I, d)\) is called a distance space. Let \(\hat{\mathbb E}^n\) denote the extended \(n\)-dimensional Euclidean space \(\mathbb E^n \cup \{\infty\}\). Fixing a ball in \(\hat{\mathbb E}^n\) as the reference ball, a kissing sphere is a sphere tangent to the reference ball, and let \(\mathbb K^n\) be the set of kissing spheres in \(\hat{\mathbb E}^n\). In this paper, the author establishes the following main results: Theorem (A). Given a finite distance space \((I, d)\), where \(d\) is not identically zero, the following statements are equivalent: (i) \((I, d)\) is isometrically embeddable into \((\mathbb K^n, d_K)\), where \(d_K\) is the distance function of \(\mathbb K^n\). (ii) The rank of the distance matrix \(D(I,d)\) is at most \(n+1\) and \((-1)^{| J|}\det D(J,d) \leq 0\) for all \(J \subseteq I\). (iii) The distance matrix \(D(I, d)\) has exactly one positive eigenvalue and at most \(n\) negative eigenvalues. Theorem (B). \((\mathbb K^n, d_K)\) and \((\mathbb L^n_+, d_L)\) are isometric, where \((\mathbb L^n_+, d_L)\) is the set of vectors whose last coordinate is positive excluding the origin.
    0 references
    0 references
    distance geometry
    0 references
    distance matrix
    0 references
    Cayley-Menger matrix
    0 references
    matrix completion
    0 references
    distance completion
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references