Related papers: On Saxe's theorems about the complexity of the Dis…
Distance matrices of graphs were introduced by Graham and Pollack in 1971 to study a problem in communications. Since then, there has been extensive research on the distance matrices of graphs -- a 2014 survey by Aouchiche and Hansen on…
Data are often represented as graphs. Many common tasks in data science are based on distances between entities. While some data science methodologies natively take graphs as their input, there are many more that take their input in…
We review some basic results of convex analysis and geometry in $\mathbb{R}^n$ in the context of formulating a differential equation to track the distance between an observer flying outside a convex set $K$ and $K$ itself.
This article surveys the development of the theory of algebraic geometry codes since their discovery in the late 70's. We summarize the major results on various problems such as: asymptotic parameters, improved estimates on the minimum…
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high…
This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…
Recent developments in Seiberg-Witten theory and relations with Complex Geometry.
This paper, in French, is a celebration of Max Dehn, and an essay of describing some of his results published in the beginning of the 1910's, and their offspring. It has been written up for a winter school in Les Diablerets, March 7-12,…
Although Bayesian methods are robust and principled, their application in practice could be limited since they typically rely on computationally intensive Markov Chain Monte Carlo algorithms for their implementation. One possible solution…
This text is a short but comprehensive introduction to the basics of supergeometry and includes some of the recent advances in colored supergeometry. We do not aim for a standard text that states results and proves them more or less…
In 1960, Klee showed that a subset of a Euclidean space must be a singleton provided that each point in the space has a unique farthest point in the set. This classical result has received much attention; in fact, the Hilbert space version…
For almost twenty years, a search for a Lorentzian version of the well-known Connes' distance formula has been undertaken. Several authors have contributed to this search, providing important milestones, and the time has now come to put…
Motivated by recent progress of structural optimization problems, the paper presents a new method for constructing the distance function to the boundary of given sets of interest, which simplifies the optimization procedure. We extend the…
This note addresses computational difficulty of the Gromov-Wasserstein distance frequently mentioned in the literature. We provide details on the structure of the Gromov-Wasserstein distance optimization problem that show its non-convex…
This is a survey paper on several aspects of differential geometry for the last 30 years, especially in those areas related to non-linear analysis. It grew from a talk I gave on the occasion of seventieth anniversary of Chinese Mathematical…
The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
We introduce a new complexity measure of a path of (problems, solutions) pairs in terms of the length of the path in the condition metric which we define in the article. The measure gives an upper bound for the number of Newton steps…
The metric Bezout Theorem proved in an earlier paper can be extended to a derivative version that compares derivatives of the algebraic distance of a point $\theta$ to two properly intersecting cycles in projective space with the…