Related papers: A Geometric Solution to the Isoperimetric Problem …
In this pedagogical note we present a short proof of the following main result of arxiv.org/abs/0911.5319, and clarify its relation to the isoperimetric problem. On the hyperbolic plane consider triangles ABC with fixed lengths of AB and…
In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…
Real-world optimization problems are often constrained by complex physical laws that limit computational scalability. These constraints are inherently tied to complex regions, and thus learning models that incorporate physical and geometric…
The aim of this paper is to prove isoperimetric inequalities on submanifolds of the Euclidean space using mass transportation methods. We obtain a sharp ?weighted isoperimetric inequality? and a nonsharp classical inequality similar to the…
The state of art of electromagnetic integral equations has seen significant growth over the past few decades, overcoming some of the fundamental bottlenecks: computational complexity, low frequency and dense discretization breakdown,…
We consider the fundamental task of optimising a real-valued function defined in a potentially high-dimensional Euclidean space, such as the loss function in many machine-learning tasks or the logarithm of the probability distribution in…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
We study quantitative isoperimetric inequalities for two different perimeter-type functionals. We first consider classical capillarity functionals, which measure the perimeter of sets in a Euclidean half-space, assigning a constant weight…
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
We present an inverse problem which uses the renormalized area functional on minimal submanifolds to recover the expansion of asymptotically hyperbolic, conformally compact metrics which are partially even to high order. We use a rigidity…
We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…
The paper studies a geometrically robust least-squares problem that extends classical and norm-based robust formulations. Rather than minimizing residual error for fixed or perturbed data, we interpret least-squares as enforcing approximate…
We propose a numerical method for the solution of electromagnetic problems on axisymmetric domains, based on a combination of a spectral Fourier approximation in the azimuthal direction with an IsoGeometric Analysis (IGA) approach in the…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
We introduce a symmetric (log-)epiperimetric inequality, generalizing the standard epiperimetric inequality, and we show that it implies a growth-decay for the associated energy: as the radius increases energy decays while negative and…
We obtain a sharp quantitative isoperimetric inequality for nonlocal $s$-perimeters, uniform with respect to $s$ bounded away from $0$. This allows us to address local and global minimality properties of balls with respect to the…