Related papers: Approximating the Convex Hull via Metric Space Mag…
Moment closure methods appear in myriad scientific disciplines in the modelling of complex systems. The goal is to achieve a closed form of a large, usually even infinite, set of coupled differential (or difference) equations. Each equation…
In Euclidean space, the integration by parts formula for a set of finite perimeter is expressed by the integration with respect to a type of surface measure. According to geometric measure theory, this surface measure is realized by the…
Order of magnitude reasoning - reasoning by rough comparisons of the sizes of quantities - is often called 'back of the envelope calculation', with the implication that the calculations are quick though approximate. This paper exhibits an…
Magnitude homology was introduced by Hepworth and Willerton in the case of graphs, and was later extended by Leinster and Shulman to metric spaces and enriched categories. Here we introduce the dual theory, magnitude cohomology, which we…
Inspired by the concept of hyperconvexity and its relation to curvature, we translate geometric properties of a metric space encoded by the curvature inequalities into the persistent homology induced by the \v{C}ech filtration of that…
This paper studies the magnitude homology groups of geodesic metric spaces. We start with a description of the second magnitude homology of a general metric space in terms of the zeroth homology groups of certain simplicial complexes. Then,…
The purpose of this article is twofold. Firstly, we use the next-token probabilities given by a language model to explicitly define a category of texts in natural language enriched over the unit interval, in the sense of Bradley, Terilla,…
We study the convex hulls of reachable sets of nonlinear systems with bounded disturbances and uncertain initial conditions. Reachable sets play a critical role in control, but remain notoriously challenging to compute, and existing…
Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…
For a given metric measure space $(X,d,\mu)$ we consider finite samples of points, calculate the matrix of distances between them and then reconstruct the points in some finite-dimensional space using the multidimensional scaling (MDS)…
A set in the Euclidean plane is said to be biconvex if, for some angle $\theta\in[0,\pi/2)$, all its sections along straight lines with inclination angles $\theta$ and $\theta+\pi/2$ are convex sets (i.e, empty sets or segments).…
Magnitude homology of enriched categories, and in particular of metric spaces, was recently introduced by T. Leinster and M. Shulman. In this article, we prove that metric spaces satisfying a reasonably mild condition have vanishing…
This paper presents a novel geometrical approach to investigate the convexity of a density-based cluster. Our approach is grid-based and we are about to calibrate the value space of the cluster. However, the cluster objects are coming from…
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We consider the space of convex functions defined in the Euclidean $n$-dimensional space, which are lower semi-continuous and tend to infinity at infinity. We study real-valued valuations defined on this space of functions, which are…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of…
This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…
In various areas of modern physics and in particular in quantum gravity or foundational space-time physics it is of great importance to be in the possession of a systematic procedure by which a macroscopic or continuum limit can be…