Related papers: The discrete logarithmic Minkowski problem
In analogy with the classical Minkowski problem, necessary and sufficient conditions are given to assure that a given measure on the unit sphere is the cone-volume measure of the unit ball of a finite dimensional Banach space.
The Minkowski problem for electrostatic capacity characterizes measures generated by electrostatic capacity, which is a well-known variant of the Minkowski problem. This problem has been generalized to $L_p$ Minkowski problem for…
Minkowski's classical existence theorem provides necessary and sufficient conditions for a Borel measure on the unit sphere of Euclidean space to be the surface area measure of a convex body. The solution is unique up to a translation. We…
In this paper, we establish a necessary condition for the logarithmic Minkowski problem in higher dimensions. This result generalizes a necessary condition proposed by Liu, Lu, Sun, and Xiong in their investigation of the two-dimensional…
The dual Minkowski problem for even data asks what are the necessary and sufficient conditions on an even prescribed measure on the unit sphere for it to be the $q$-th dual curvature measure of an origin-symmetric convex body in…
The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…
We prove that an approximated version of the Brunn--Minkowski inequality with volume distortion coefficient implies a Gaussian concentration-of-measure phenomenon. Our main theorem is applicable to discrete spaces.
Motivated by the discrete logarithmic Minkowski problem we study for a given matrix $U\in\mathbb{R}^{n\times m}$ its cone-volume set $C_{\tt cv}(U)$ consisting of all the cone-volume vectors of polytopes $P(U,b)=\{ x\in\mathbb{R}^n :…
The existence of solutions to the Gaussian logarithmic Minkowski problem for C-pseudo-cones is established in this paper. In addition, the non-uniqueness of solutions to the problem is demonstrated.
Under study are some vector optimization problems over the space of Minkowski balls, i.e., symmetric convex compact subsets in Euclidean space. A typical problem requires to achieve the best result in the presence of conflicting goals;…
The current state of art concerning the $L_p$ Minkowski problem as a Monge-Ampere equation on the sphere and Lutwak's Logarithmic Minkowski conjecture about the uniqueness of even solution in the $p=0$ case are surveyed and connections to…
In this paper, we prove the uniqueness of solutions to the logarithmic Minkowski problem in $\mathbb{R}^3$ without symmetry condition, provided the density of the measure is close to $1$ in $C^{\alpha}$ norm. This result also implies the…
In this paper, we solve the $L_p$ chord Minkowski problem in the case of discrete measures whose supports are in general position for negative $p$ and $q>0.$ As for general Borel measure with a density, we also give a proof but need…
A variational formula is derived by combining the Gaussian volume of the epigraph of a convex function $\varphi$ and the perturbation of $\varphi$ via the infimal convolution. This formula naturally leads to a Borel measure on…
Necessary and sufficient conditions are given for the existence of solutions to the discrete Lp Minkowski problem for the critical case where 0 < p < 1.
The Gaussian surface area measure and the Gaussian cone measure for $C$-pseudo-cones are introduced and their corresponding Gaussian Minkowski problem and Gaussian log-Minkowski problem are proposed, respectively. The existence and…
The Minkowski problem in convex geometry concerns showing that a given Borel measure on the unit sphere is, up to perhaps a constant, some type of surface area measure of a convex body. Two types of Minkowski problems in particular are an…
Minkowski's Theorem asserts that every centered measure on the sphere which is not concentrated on a great subsphere is the surface area measure of some convex body, and, moreover, the surface area measure determines a convex body uniquely.…
This letter casts the problem of optimum discrete beamforming as the computation of the Minkowski sum of convex polygons, which is itself a convex polygon. The number of vertices of the latter is at most the sum of the number of vertices of…
One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…