Related papers: On Saxe's theorems about the complexity of the Dis…

The solution of the geodesic problem for an oblate ellipsoid is developed in terms of series. Tables are provided to simplify the computation. [This is an English translation of F. W. Bessel, Astronomische Nachrichten 4(86), 241-254 (1825).…

Graphs are interesting structures: extremely useful to depict real-life problems, extremely easy to understand given a sketch, extremely complicated to represent formally, extremely complicated to compare. Phylogeny is the study of the…

In this note we give a detailed proof of certain results on geometry of numbers in the $S$-adic case. These results are well-known to experts, so the aim here is to provide a convenient reference for the people who need to use them.

In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…

Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…

J. Hempel's definition of the distance of a Heegaard surface generalizes to a complexity for a knot which is in bridge position with respect to a Heegaard surface. Our main result is that the distance of a knot in bridge position is bounded…

This is an overview of recent developments regarding the complexity of matrix multiplication, with an emphasis on the uses of algebraic geometry and representation theory in complexity theory.

The Four-Vertex Theorem has been of interest ever since a discrete version appeared in 1813 due to Cauchy. Up until now, there have been many different versions of this theorem, both for discrete cases and smooth cases. In 2004, an approach…

The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension K, where the edges are realized as straight segments of lengths equal (or as close as possible) to the…

We give an overview of different approaches to measuring the similarity of, or the distance between, two graphs, highlighting connections between these approaches. We also discuss the complexity of computing the distances.

This note summarizes the talk by the author at the workshop "Geometry and Computer Science" held in Pescara in February 2017. We present how SageMath can help in research in Complex and Differential Geometry, with two simple applications,…

Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…

This article is a survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be accessible to graduate students. Numerous open questions in…

We survey selected developments in the metric geometry of the space of K\"ahler metrics, emphasizing results from the past decade, highlighting open problems along the way.

This is an expository treatise on the development of the classical geometries, starting from the origins of Euclidean geometry a few centuries BC up to around 1870. At this time classical differential geometry came to an end, and the…

This review is dedicated to some modern applications of the remarkable paper written in 1918 by E. Noether. On a single paper, Noether discovered the crucial relation between symmetries and conserved charges as well as the impact of gauge…

In the first part of this thesis, we consider an instance of Frechet distance problem in which the speed of traversal along each segment of the curves is restricted to be within a specfied range. This setting is more realistic than the…

We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran et al,…

We give a brief survey of some of the geometry of mirror symmetry, written in 2004 for the "Encyclopaedia of Mathematical Physics". Probably a little bit out of date now in a few places, but hey.

We study a family of distance functions on rankings that allow for asymmetric treatments of alternatives and consider the distinct relevance of the top and bottom positions for ordered lists. We provide a full axiomatic characterization of…