2000 character limit reached
IDP for 2-Partition Maximal Symmetric Polytopes
Published 7 Jan 2025 in math.CO | (2501.04191v1)
Abstract: We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where it lies in a hyperplane of $\mathbb{R}3$. Our method involves proving a special collection of polynomials have saturated Newton polytope.
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.