Related papers: A Quantitative Cram\'er-Wold Theorem for Zolotarev…
We find an upper bound for the Gromov width of coadjoint orbits of U(n) with respect to the Kirillov-Kostant-Souriau symplectic form by computing certain Gromov-Witten invariants. The approach presented here is closely related to the one…
Let $\nu\in M^1([0,\infty[)$ be a fixed probability measure. For each dimension $p\in \mathbb{N}$, let $(X_n^{p})_{n\geq1}$ be i.i.d. $\mathbb{R}^p$-valued random variables with radially symmetric distributions and radial distribution…
The article proves an assertion analogous to the Littlewood-Paley theorem for the orthoprojectors onto mutually orthogonal subspaces of piecewise polynomial functions on the cube $ I^d. $ This assertion provides an upper estimate for the…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
We produce an upper bound for the Hausdorff dimension of the graph of a Weierstrass-type function. Whilst strictly weaker than existing results, it has the advantage of being directly computable from the theory of hyperbolic iterated…
The Koml\'os$\unicode{x2013}$Major$\unicode{x2013}$Tusn\'ady (KMT) inequality for partial sums is one of the most celebrated results in probability theory. Yet its practical application has been hindered by a lack of practical constants.…
Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…
The Born rule provides a probability vector (distribution) with a quantum state for a measurement setting. For two settings, we have a pair of vectors from the same quantum state. Each pair forms a combined-probability vector that obeys…
Labeled Markov Chains (or LMCs for short) are useful mathematical objects to model complex probabilistic languages. A central challenge is to compare two LMCs, for example to assess the accuracy of an abstraction or to quantify the effect…
Distance covariance is a measure of dependence between two random variables that take values in two, in general different, metric spaces, see Sz\'ekely, Rizzo and Bakirov (2007) and Lyons (2013). It is known that the distance covariance,…
We prove that a bounded open set U in Euclidean n-space has k-width less than C(n) Volume(U)^{k/n}. Using this estimate, we give lower bounds for the k-dilation of degree 1 maps between certain domains in Euclidean space. In particular, we…
We give an upper bound on the number of rational points of an arbitrary Zariski closed subset of a projective space over a finite field. This bound depends only on the dimensions and degrees of the irreducible components and holds for very…
We obtain sharp upper bounds for the first two nonzero Steklov eigenvalues among bounded domains in Euclidean spaces of dimension $d \geq 7$ under a natural normalization involving volume and boundary measure. These bounds are derived from…
Comparison of $1$-dimensional distance functions is a basic tool in Alexandrov geometry and it is used to characterize spaces with curvature bounded above or below. For the zero curvature bound there is a differential inequality which…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…
Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on…
We give a positive answer to a conjecture of Aluffi-Harris on the computation of the Euclidean distance degree of a possibly singular projective variety in terms of the local Euler obstruction function.
We prove several Sobolev inequalities, which are then used to establish a fractional Hardy-Sobolev- Maz'ya inequality on the upper halfspace.
The correlation distance quantifies the statistical independence of two classical or quantum systems, via the distance from their joint state to the product of the marginal states. Tight lower bounds are given for the mutual information…