Related papers: Finding the convex envelope of a boundary datum us…

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

In bounded domains, without any geometric conditions, we study the existence and uniqueness of globally Lipschitz and interior strong C^{1,1}, (and classical C^2), solutions of general semilinear oblique boundary value problems for…

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

We establish an approximate fixed point result for self-maps on compact convex subsets of Hausdorff topological vector spaces where continuity is not a necessary condition.

We study the discrepancy between the distribution of a vector-valued functional of i.i.d. random elements and that of a Gaussian vector. Our main contribution is an explicit bound on the convex distance between the two distributions,…

Let $\Omega$ be a domain in $\mathbb R^N$, where $N \ge 2$ and $\partial\Omega$ is not necessarily bounded. We consider two fast diffusion equations $\partial_t u= \mbox{div}(|\nabla u|^{p-2}{\nabla u})$ and $\partial_t u= \Delta u^{m}$,…

A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{…

We consider the distributed optimization problem for the sum of convex functions where the underlying communications network connecting agents at each time is drawn at random from a collection of directed graphs. Building on an earlier work…

In this article, we analyse the domain mapping method approach to approximate statistical moments of solutions to linear elliptic partial differential equations posed over random geometries including smooth surfaces and bulk-surface…

Now a final and maybe simplest formulation of the enclosure method applied to inverse obstacle problems governed by partial differential equations in a {\it spacial domain with an outer boundary} over a finite time interval is fixed. The…

We show that the Morse index of a properly embedded free boundary minimal hypersurface in a strictly mean convex domain of the Euclidean space grows linearly with the dimension of its first relative homology group (which is at least as big…

Consider the problem of drawing random variates $(X_1,\ldots,X_n)$ from a distribution where the marginal of each $X_i$ is specified, as well as the correlation between every pair $X_i$ and $X_j$. For given marginals, the…

In this paper a compact Riemannian manifold with strictly convex boundary is reconstructed from its partial travel time data. This data assumes that an open measurement region on the boundary is given, and that for every point in the…

We consider the three-dimensional incompressible free-boundary Euler equations in a bounded domain and with surface tension. Using Lagrangian coordinates, we establish a priori estimates for solutions with minimal regularity assumptions on…

We study the question of approximating a compact geodesic metric space by metric graphs satisfying a uniform upper bound on their first Betti number. We prove that, up to a suitable multiplicative constant, Reeb graphs of distance functions…

We develop a sketching algorithm to find the point on the convex hull of a dataset, closest to a query point outside it. Studying the convex hull of datasets can provide useful information about their geometric structure and their…

Boundary value problems on the unit sphere arise naturally in geophysics and oceanography when scientists model a physical quantity on large scales. Robust numerical methods play an important role in solving these problems. In this article,…

We establish the first quantitative Berry-Esseen bounds for edge eigenvector statistics in random regular graphs. For any $d$-regular graph on $N$ vertices with fixed $d \geq 3$ and deterministic unit vector $\mathbf{q} \perp \mathbf{e}$,…

We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as…

Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…