Related papers: On Saxe's theorems about the complexity of the Dis…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
This is a partial account of the fascinating history of Distance Geometry. We make no claim to completeness, but we do promise a dazzling display of beautiful, elementary mathematics. We prove Heron's formula, Cauchy's theorem on the…
The concept of homotopic distance and its higher analog are introduced in [6]. In this paper we introduce some important properties of higher homotopic distance, investigate the conditions under which $\cat$, $\secat$ and higher dimensional…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
Lipman et al. [ACM Transactions on Graphics 29 (3) (2010), 1--11] introduced the concept of biharmonic distance to measure the distances between pairs of points on a 3D surface. Biharmonic distance has some advantages over resistance…
Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced…
We give a short introduction, beginning with the Kerr geometry itself, to the basic results, motivation, open problems and future directions of the Kerr/CFT correspondence.
This survey contains an exposition of ideas and results related to Faltings' proof of the conjectures of Shafarevich, Tate and Mordell. This paper originally appeared in 1986 as an Appendix to the Russian translation of Serge Lang,…
We survey the history and recent developments around two decades-old problems that continue to attract a great deal of interest: the slicing $\times 2$, $\times 3$ conjecture of H. Furstenberg in ergodic theory, and the distance set problem…
Knowing the distance of an astrophysical object is key to understanding it. However, at present, comparisons of theory and observations are hampered by precision (or lack thereof) in distance measurements or estimates. Putting the many…
We introduce a notion of distance between supervised learning problems, which we call the Risk distance. This distance, inspired by optimal transport, facilitates stability results; one can quantify how seriously issues like sampling bias,…
Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…
We show that all the standard distances from metric geometry and functional analysis, such as Gromov-Hausdorff distance, Banach-Mazur distance, Kadets distance, Lipschitz distance, Net distance, and Hausdorff-Lipschitz distance have all the…
This paper is based on a talk presented by the first author at the Short Program on Riemannian Geometry that took place at the Centre de Recherche Math\'ematiques, Universit\'e de Montr\'eal, during the period June 28-July 16, 2004. It is a…
In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…
This paper gives an overview of several key innovations in the 19th century which led to complex geometry in the 20th century. This includes the creation of the complex plane, the work of Abel on addition theorems for generalized elliptic…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…
In 2001, J. Hempel proved the existence of Heegaard splittings of arbitrarily high distance by using a high power of a pseudo-Anosov map as the gluing map between two handlebodies. We show that lower bounds on distance can also be obtained…
This survey of some of the more topological aspects of the placement problem for complex curves in complex surfaces was originally published in L'Enseignement Mathematique 29 (1983). The present LaTeXed redaction corrects several…