IDP for 2-Partition Maximal Symmetric Polytopes
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 R3. Our method involves proving a special collection of polynomials have saturated Newton polytope.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.