Do you want to publish a course? Click here

The Minkowski problem in the Gaussian probability space

64   0   0.0 ( 0 )
 Added by Yiming Zhao
 Publication date 2020
  fields
and research's language is English




Ask ChatGPT about the research

The Minkowski problem in Gaussian probability space is studied in this paper. In addition to providing an existence result on a Gaussian-volume-normalized version of this problem, the main goal of the current work is to provide uniqueness and existence results on the Gaussian Minkowski problem (with no normalization required).



rate research

Read More

117 - Yiming Zhao 2017
Recently, the duals of Federers curvature measures, called dual curvature measures, were discovered by Huang, Lutwak, Yang, and Zhang (ACTA, 2016). In the same paper, they posed the dual Minkowski problem, the characterization problem for dual curvature measures, and proved existence results when the index, q, is in (0,n). The dual Minkowski problem includes the Aleksandrov problem (q = 0) and the logarithmic Minkowski problem (q = n) as special cases. In the current work, a complete solution to the dual Minkowski problem whenever q < 0, including both existence and uniqueness, is presented.
We consider geometrical optimization problems related to optimizing the error probability in the presence of a Gaussian noise. One famous questions in the field is the weak simplex conjecture. We discuss possible approaches to it, and state related conjectures about the Gaussian measure, in particular, the conjecture about minimizing of the Gaussian measure of a simplex. We also consider antipodal codes, apply the v{S}idak inequality and establish some theoretical and some numerical results about their optimality.
112 - Yuchi Wu 2020
In this paper, we prove a Prekopa-Leindler type inequality of the $L_p$ Brunn-Minkowski inequality. It extends an inequality proved by Das Gupta [8] and Klartag [16], and thus recovers the Prekopa-Leindler inequality. In addition, we prove a functional $L_p$ Minkowski inequality.
We prove that the largest convex shape that can be placed inside a given convex shape $Q subset mathbb{R}^{d}$ in any desired orientation is the largest inscribed ball of $Q$. The statement is true both when largest means largest volume and when it means largest surface area. The ball is the unique solution, except when maximizing the perimeter in the two-dimensional case.
In this note we prove that on general metric measure spaces the perimeter is equal to the relaxation of the Minkowski content w.r.t. convergence in measure
comments
Fetching comments Fetching comments
mircosoft-partner

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