Related papers: A minimal partition problem with trace constraint …
We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" $F$, i.e., a union of curves of minimum total length, that separates every two objects of different colors. Two…
This paper presents a framework for computing the Gromov-Wasserstein problem between two sets of points in low dimensional spaces, where the discrepancy is the squared Euclidean norm. The Gromov-Wasserstein problem is a generalization of…
We consider the problem of minimising the $k$-th eigenvalue of the Laplacian with some prescribed boundary condition over collections of convex domains of prescribed perimeter or diameter. It is known that these minimisation problems are…
Optimal Transport has received much attention in Machine Learning as it allows to compare probability distributions by exploiting the geometry of the underlying space. However, in its original formulation, solving this problem suffers from…
We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…
We establish the Gaussian Double-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose $\mathbb{R}^n$ into three cells of prescribed (positive) Gaussian measure is to use a tripod-cluster, whose interfaces consist of…
This monograph is centred at the intersection of three mathematical topics, that are theoretical in nature, yet with motivations and relevance deep rooted in applications: the linear inverse problems on abstract, in general…
Minimum Riesz energy problems in the presence of an external field are analyzed for a condenser with touching plates. We obtain sufficient and/or necessary conditions for the solvability of these problems in both the unconstrained and the…
We consider a projection from the center of the unit sphere to a tangent space of it, the central projection, and study two area minimizing problems of the image of a closed subset in the sphere. One of the problems is the uniqueness of the…
We study the problem of computing the minimum area triangle that circumscribes a given $n$-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of $n$…
We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$…
Motivated by recent interest in elastic problems in which the target space is non-Euclidean, we study a limit where local rest distances within an elastic body are incompatible, yet close to, distances within the ambient space.…
In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…
Three approximation problems in Krein spaces are studied, namely the indefinite weighted least squares problem and the related problems of indefinite abstract splines and smoothing. In every case, we analyze if the problem has a solution…
This paper studies the subspace clustering problem in which data points collected from high-dimensional ambient space lie in a union of linear subspaces. Subspace clustering becomes challenging when the dimension of intersection between…
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
In this work we investigate the following isoperimetric problem in the hyperbolic plane: to find the regions of prescribed area with minimal perimeter between two parallel horocycles. We give an explicit and detailed description of all such…