Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 173 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 205 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

On polynomial inequalities for cone-volumes of polytopes (2506.15370v1)

Published 18 Jun 2025 in math.MG

Abstract: 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 : U\intercal x\leq b}$, $b\in\mathbb{R}n_{\geq 0}$. We will show that $C_{\tt cv}(U)$ 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 $P_{\tt scc}(U)$ 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 $U$, and these two sets, $P_{\tt scc}(U)$ and $C_{\tt cv}(U)$, also offer a new geometric point of view to the discrete logarithmic Minkowski problem.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.