Related papers: Approximate Gaussian isoperimetry for k sets
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
Let K\subset R^N be any convex body containing the origin. A measurable set G\subset R^N with finite and positive Lebesgue measure is said to be K-dense if, for any fixed r>0, the measure of G\cap (x+r K) is constant when x varies on the…
Given any $\varepsilon>0$, we construct an orthonormal system of $n_k$ uniformly bounded polynomials of degree at most $k$ on the unit sphere in $\mathbb R^{m+1}$ where $n_k$ is bigger than $1-\varepsilon$ times the dimension of the space…
We study mappings differentiable almost everywhere, possessing the $N$-Luzin property, the $ N^{\,-1}$-property on the spheres with respect to the $(n-1)$-dimensional Hausdorff measure and such that the image of the set where its Jacobian…
Combining the tools of geometric analysis with properties of Jordan angles and angle space distributions, we derive a spherical and a Euclidean Bernstein theorem for minimal submanifolds of arbitrary dimension and codimension, under the…
We investigate the minimal error in approximating a general probability measure $\mu$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In…
Two recent landmark experiments have performed Gaussian boson sampling (GBS) with a non-programmable linear interferometer and threshold detectors on up to 144 output modes (see Refs.~\onlinecite{zhong_quantum_2020,zhong2021phase}). Here we…
Let $M$ be a smooth, connected, compact submanifold of $\mathbb{R}^n$ without boundary and of dimension $k\geq 2$. Let $\mathbb{S}^k \subset \mathbb{R}^{k+1}\subset \mathbb{R}^n$ denote the $k$-dimesnional unit sphere. We show if $M$ has…
Many Gibbs measures with mean field interactions are known to be chaotic, in the sense that any collection of $k$ particles in the $n$-particle system are asymptotically independent, as $n\to\infty$ with $k$ fixed or perhaps $k=o(n)$. This…
A known general program, designed to endow the quotient space ${\cal U}_{\cal A} / {\cal U}_{\cal B}$ of the unitary groups ${\cal U}_{\cal A}$, ${\cal U}_{\cal B}$ of the C$^*$ algebras ${\cal B}\subset{\cal A}$ with an invariant Finsler…
For $S\subseteq V(G)$ and $|S|\geq 2$, $\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\leq k\leq n$, the \emph{generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is then…
We consider the problem of minimizing the size of a family of sets G such that every subset of 1,...,n can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world…
This paper establishes the theoretical foundations for the asymptotic separability of Gaussian Mixture Models (GMMs) in high dimensions by extending the classical Feldman-H\'ajek theorem. We first prove that a countable mixture of Gaussian…
Given a convex body $K \subseteq \mathbb R^n$ in L\"owner position we study the problem of constructing a non-negative centered isotropic measure supported in the contact points, whose existence is guaranteed by John's Theorem. The method…
One of the most popular algorithms for clustering in Euclidean space is the $k$-means algorithm; $k$-means is difficult to analyze mathematically, and few theoretical guarantees are known about it, particularly when the data is {\em…
A metric space $\mathcal{S}$ is called a \defn{quasisphere} if there is a quasisymmetric homeomorphism $f\colon S^2\to \mathcal{S}$. We consider the elliptic harmonic measure, i.e., the push forward of 2-dimensional Lebesgue measure by $f$.…
Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…
A spherical $t$-design is a finite subset $X$ of the unit sphere such that every polynomial of degree at most $t$ has the same average over $X$ as it does over the entire sphere. Determining the minimum possible size of spherical designs,…
We consider the problem of computing the minimum value $f_{\min,K}$ of a polynomial $f$ over a compact set $K \subseteq \mathbb{R}^n$, which can be reformulated as finding a probability measure $\nu$ on $K$ minimizing $\int_K f d\nu$.…
In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or…