English

IDP for 2-Partition Maximal Symmetric Polytopes

Combinatorics 2025-01-09 v1

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 22-partition maximal polytopes in the case where it lies in a hyperplane of R3\mathbb{R}^3. Our method involves proving a special collection of polynomials have saturated Newton polytope.

Keywords

Cite

@article{arxiv.2501.04191,
  title  = {IDP for 2-Partition Maximal Symmetric Polytopes},
  author = {Su Ji Hong and George D. Nasr},
  journal= {arXiv preprint arXiv:2501.04191},
  year   = {2025}
}
R2 v1 2026-06-28T20:59:21.261Z