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 $\mathbb{R}^{3}$. Our method involves proving a special collection of polynomials that have saturated Newton polytope.
Fields of Study & Subjects
graph theory and CDMA systems
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- Journal of Combinatorics
- Publisher
- International Press of Boston
- Volume
- 17
- Issue
- 3
- Pages
- 355–368
- Publication date
- 1 January 2026
- Language
- EN