Six mathematical gems from the history of distance geometry

DOI10.1111/itor.12170zbMath1362.51002arXiv1502.02816OpenAlexW2964256955WikidataQ62562133 ScholiaQ62562133MaRDI QIDQ2827761

Leo Liberti, Carlile C. Lavor

Publication date: 21 October 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02816

zbMATH Keywords

multidimensional scalingEuclidean distance matrixEuler's conjectureCayley-Menger determinants

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) General theory of distance geometry (51K05) Research exposition (monographs, survey articles) pertaining to history and biography (01-02) History of geometry (51-03)

Related Items

A note on the Cayley-Menger determinant and the molecular distance geometry problem, Unassigned distance geometry and molecular conformation problems, A Menger Redux: Embedding Metric Spaces Isometrically in Euclidean Space, A constrained interval approach to the generalized distance geometry problem, Triangle diagram, distance geometry and symmetries of Feynman integrals, Distance geometry and data science, An even more straightforward proof of Descartes's circle theorem, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, Minimal NMR distance information for rigidity of protein graphs, Oriented conformal geometric algebra and the molecular distance geometry problem, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Bipartite sets of spheres and Casey-type theorems, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the optimality of finding DMDGP symmetries, Preface: Special issue dedicated to distance geometry, Preface, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, A quantum approach to the discretizable molecular distance geometry problem

Cites Work

• Discretization orders for distance geometry problems
• The axiomatic method. With special reference to geometry and physics. Proceedings of an International Symposium held at the University of California, Berkeley, December 26, 1957 -- January 4, 1958
• Theory of semidefinite programming for sensor network localization
• A counterexample to the rigidity conjecture for polyhedra
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Modern multidimensional scaling: theory and applications
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Distance Geometry
• Extensions of Lipschitz mappings into a Hilbert space
• Cayley-Menger coordinates.
• Euclidean Distance Geometry and Applications
• Geometrical problems concerning polyhedra in the large
• Unnamed Item
• Unnamed Item
• Unnamed Item