Related papers: Convexity of a Small Ball Under Quadratic Map

We investigate the regularity of the marginals onto hyperplanes for sets of finite perimeter. We prove, in particular, that if a set of finite perimeter has log-concave marginals onto a.e. hyperplane then the set is convex.

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

In this paper we study the space $\mathcal{M}$ of all nonempty compact metric spaces considered up to isometry, equipped with the Gromov--Hausdorff distance. We show that each ball in $\mathcal{M}$ with center at the one-point space is…

W. Schmidt, H. Montgomery, and J. Beck proved a result on irregularities of distribution with respect to $d$-dimensional balls. In this paper, we extend their result to any $d$-dimensional convex body with a smooth boundary and finite order…

Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…

We consider the problem of wrapping three-dimensional solid bodies with a given planar sheet of paper, where the paper may be folded or wrinkled but not stretched or torn. We propose a conjecture characterising the maximumvolume solid…

A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…

For a graph $G$, the unraveled ball of radius $r$ centered at a vertex $v$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$. We obtain a lower bound on the weighted spectral radius of unraveled balls of fixed radius…

We use matrix iteration theory to characterize acceleration in smooth games. We define the spectral shape of a family of games as the set containing all eigenvalues of the Jacobians of standard gradient dynamics in the family. Shapes…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

For the minimal graph with strict convex level sets, we find an auxiliary function to study the Gaussian curvature of the level sets. We prove that this curvature function is a concave function with respect to the height of the minimal…

In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…

The uniform quadratic optimizatin problem (UQ) is a nonconvex quadratic constrained quadratic programming (QCQP) sharing the same Hessian matrix. Based on the second-order cone programming (SOCP) relaxation, we establish a new sufficient…

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

Several new verifiable conditions are established for block matrices with scalar diagonal blocks to have the numerical range equal the convex hull of at most k ellipses where k by k is the size of the smaller diagonal block. For k = 2,…

We will consider close-to-convexity of the metric balls defined by the quasihyperbolic metric and the $j$-metric. We will show that the $j$-metric balls with small radii are close-to-convex in general subdomains of $\Rn$ and the…