2000 character limit reached
The discrete logarithmic Minkowski problem
Published 28 Sep 2014 in math.MG | (1409.7907v3)
Abstract: Existence of solution of the logarithmic Minkowski problem is proved for the case where the discrete measures on the unit sphere satisfy the subspace concentration condition with respect to some special proper subspaces. In order to understand how optimal this condition is, we discuss certain conditions that any cone volume measure satisfies.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.