On polynomial inequalities for cone-volumes of polytopes
Metric Geometry
2025-06-19 v1
Abstract
Motivated by the discrete logarithmic Minkowski problem we study for a given matrix its cone-volume set consisting of all the cone-volume vectors of polytopes , . We will show that is a path-connected semialgebraic set which extends former results in the planar case or for particular polytopes. Moreover, we define a subspace concentration polytope which represents geometrically the subspace concentration conditions for a finite discrete Borel measure on the sphere. This is up to a scaling the basis matroid polytope of , and these two sets, and , also offer a new geometric point of view to the discrete logarithmic Minkowski problem.
Cite
@article{arxiv.2506.15370,
title = {On polynomial inequalities for cone-volumes of polytopes},
author = {Tom Baumbach and Martin Henk},
journal= {arXiv preprint arXiv:2506.15370},
year = {2025}
}