Do you want to publish a course? Click here

Mixed volumes and the Bochner method

79   0   0.0 ( 0 )
 Added by Ramon van Handel
 Publication date 2018
  fields
and research's language is English




Ask ChatGPT about the research

At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the deepest results of this theory is the Alexandrov-Fenchel inequality, which subsumes many known inequalities as special cases. The aim of this note is to give new proofs of the Alexandrov-Fenchel inequality and of its matrix counterpart, Alexandrovs inequality for mixed discriminants, that appear conceptually and technically simpler than earlier proofs and clarify the underlying structure. Our main observation is that these inequalities can be reduced by the spectral theorem to certain trivial `Bochner formulas.



rate research

Read More

In a seminal paper Volumen und Oberflache (1903), Minkowski introduced the basic notion of mixed volumes and the corresponding inequalities that lie at the heart of convex geometry. The fundamental importance of characterizing the extremals of these inequalities was already emphasized by Minkowski himself, but has to date only been resolved in special cases. In this paper, we completely settle the extremals of Minkowskis quadratic inequality, confirming a conjecture of R. Schneider. Our proof is based on the representation of mixed volumes of arbitrary convex bodies as Dirichlet forms associated to certain highly degenerate elliptic operators. A key ingredient of the proof is a quantitative rigidity property associated to these operators.
We prove that on an arbitrary metric measure space a countable collection of test plans is sufficient to recover all $rm BV$ functions and their total variation measures. In the setting of non-branching ${sf CD}(K,N)$ spaces (with finite reference measure), we can additionally require these test plans to be concentrated on geodesics.
We prove the differentiability of Lipschitz maps X-->V, where X is a complete metric measure space satisfying a doubling condition and a Poincare inequality, and V is a Banach space with the Radon Nikodym Property (RNP). The proof depends on a new characterization of the differentiable structure on such metric measure spaces, in terms of directional derivatives in the direction of tangent vectors to suitable rectifiable curves.
We prove that sub-Riemannian manifolds are infinitesimally Hilbertian (i.e., the associated Sobolev space is Hilbert) when equipped with an arbitrary Radon measure. The result follows from an embedding of metric derivations into the space of square-integrable sections of the horizontal bundle, which we obtain on all weighted sub-Finsler manifolds. As an intermediate tool, of independent interest, we show that any sub-Finsler distance can be monotonically approximated from below by Finsler ones. All the results are obtained in the general setting of possibly rank-varying structures.
Let $X_1,ldots,X_n$ be i.i.d. random points in the $d$-dimensional Euclidean space sampled according to one of the following probability densities: $$ f_{d,beta} (x) = text{const} cdot (1-|x|^2)^{beta}, quad |x|leq 1, quad text{(the beta case)} $$ and $$ tilde f_{d,beta} (x) = text{const} cdot (1+|x|^2)^{-beta}, quad xinmathbb{R}^d, quad text{(the beta case).} $$ We compute exactly the expected intrinsic volumes and the expected number of facets of the convex hull of $X_1,ldots,X_n$. Asymptotic formulae where obtained previously by Affentranger [The convex hull of random points with spherically symmetric distributions, 1991]. By studying the limits of the beta case when $betadownarrow -1$, respectively $beta uparrow +infty$, we can also cover the models in which $X_1,ldots,X_n$ are uniformly distributed on the unit sphere or normally distributed, respectively. We obtain similar results for the random polytopes defined as the convex hulls of $pm X_1,ldots,pm X_n$ and $0,X_1,ldots,X_n$. One of the main tools used in the proofs is the Blaschke-Petkantschin formula.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا