graph theory and CDMA systemsAdvanced Graph Theory ResearchGraph Labeling and Dimension Problems

S. Hong, George D. Nasr

2026.1.1Journal of Combinatorics

DOI: 10.4310/joc.260511222329

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.

Citation format

HONG, S.; NASR, George D. IDP for 2-partition maximal symmetric polytopes. Journal of Combinatorics, 2026, 17(3): 355–368.