Related papers: On Saxe's theorems about the complexity of the Dis…
The paper suggests a short survey of integration algorithms which evolved since 1982. These theorems and algorithms form discrete versions of the calculus theorems.
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…
This is a slightly revised version of lectures notes for a course in Summer 2022 joint between Bonn and Copenhagen, intended as a stable citable version. The goal of this course is to make our general approach to analytic geometry via…
We sketch an assortment of problems that were posed -- and not yet solved -- during problem sessions at the conference ``Approximation Theory and Numerical Analysis meet Algebra, Geometry, and Topology'', which was held at the Palazzone…
In 1984, Plesn\'{i}k determined the minimum total distance for given order and diameter and characterized the extremal graphs and digraphs. We prove the analog for given order and radius, when the order is sufficiently large compared to the…
In this paper we outline the framework of mathematical statistics with which one may study the properties of galaxy distance estimators. We describe, within this framework, how one may formulate the problem of distance estimation as a…
This paper has been submitted to the Proceedings of the Australian-German Workshop on Differential Geometry in the Large held at the mathematical research institute MATRIX in Creswick, Victoria, Australia, Feb.2-Feb.14, 2019. We describe…
We consider several appearances of the notion of convexity in Greek antiquity, more specifically in mathematics and optics, in the writings of Aristotle, and in art. The final version of this article will appear in the book `Geometry in…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
A discretisation scheme that preserves topological features of a physical problem is extended so that differential geometric structures can be approximated in a consistent way thus giving access to the study of physical systems which are…
Understanding, finding, or even deciding on the existence of real solutions to a system of equations is a very difficult problem with many applications. While it is hopeless to expect much in general, we know a surprising amount about these…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…
We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…
A problem of Erd\H{o}s (Amer. Math. Monthly 52: 494-498, 1945) and a theorem of Fejes T\'oth and Fejes T\'oth (Acta Math. Acad. Sci. Hungar. 24: 229-232, 1973) initiated the study of non-separable arrangements of convex bodies and the…
We distinguish the axiomatic study of proofs in geometry from study about geometry from general axioms for mathematics. We briefly report on an abuse of that distinction and its unfortunate effect on US high school education. We review a…
In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…
In 1984, Plesn\'{i}k determined the minimum total distance for given order and diameter and characterized the extremal graphs and digraphs. We prove the analog for given order and radius, when the order is sufficiently large compared to the…
We generalize the family of $(\sigma, \rho)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent…
This article provides a historical overview of Geometry of Numbers. 1. Figures, 2. The circuit problem and its relatives, 3. Minkowski lattice point set, 4. The young Hermann Minkowski, 5. The geometry of numbers develops, 6. Minkowski…