Related papers: The Sylvester question in $\mathbb{R}^d$: convex s…
Given a strictly convex multiobjective optimization problem with objective functions $f_1,\dots,f_N$, let us denote by $x_0$ its solution, obtained as minimum point of the linear scalarized problem, where the objective function is the…
If four people with Gaussian-distributed heights stand at Gaussian positions on the plane, the probability that there are exactly two people whose height is above the average of the four is exactly the same as the probability that they…
We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…
For a given complex finite dimensional subspace $S$ of $\mathbb{C}^n$ and a fixed basis, we study the compact and convex subset of $\left(\mathbb{R}_{\geq 0}\right)^n$ that we call the moment of $S$ $m_S=$ convex hull…
Consider a finite system of non-strict polynomial inequalities with solution set $S\subseteq\mathbb R^n$. Its Lasserre relaxation of degree $d$ is a certain natural linear matrix inequality in the original variables and one additional…
In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…
The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…
For a probability measure on a real separable Hilbert space, we are interested in "volume-based" approximations of the d-dimensional least squares error of it, i.e., least squares error with respect to a best fit d-dimensional affine…
In this paper we study the Buchstaber invariant of simplicial complexes, which comes from toric topology. With each simplicial complex $K$ on $m$ vertices we can associate a moment-angle complex $\mathcal Z_K$ with a canonical action of the…
Assume that we observe i.i.d.~points lying close to some unknown $d$-dimensional $\mathcal{C}^k$ submanifold $M$ in a possibly high-dimensional space. We study the problem of reconstructing the probability distribution generating the…
For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…
The variance conjecture in Asymptotic Convex Geometry stipulates that the Euclidean norm of a random vector uniformly distributed in a (properly normalised) high-dimensional convex body $K\subset {\mathbb R}^n$ satisfies a Poincar\'e-type…
We prove an explicit combinatorial formula for the expected number of faces of the zero polytope of the homogeneous and isotropic Poisson hyperplane tessellation in $\mathbb R^d$. The expected $f$-vector is expressed through the…
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…
Some geometric facts concerning sets with positive reach in the Euclidean $d$-dimensional space ${\bf E}^d$ are proved. For $x_1$ and $x_2$ in ${\bf E}^d$ and $R>0$ let us denote by ${\mathfrak H}(x_1,x_2,R)$ the intersection of all closed…
Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…
We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…
The Weak Gravity Conjecture has recently been re-formulated in terms of a particle with non-negative self-binding energy. Because of the dual conformal field theory (CFT) formulation in the anti-de Sitter space the conformal dimension…
We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…
In the subspace approximation problem, we seek a k-dimensional subspace F of R^d that minimizes the sum of p-th powers of Euclidean distances to a given set of n points a_1, ..., a_n in R^d, for p >= 1. More generally than minimizing sum_i…