Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.