Year: 2026
Type: preprint
Abstract: We classify the lattice polytopes arising from vertex-weighted oriented graphs that have the integer decomposition property (IDP). Allowing vertex weights and edge orientations introduces non-vertex lattice points in the polytope which need to be accounted for when studying the IDP. We can then identify forbidden induced subgraphs in the sense that their presence obstructs the IDP for the supergraph. We establish positive results for several families of graphs under suitable orientation and coprimality conditions, including weighted oriented paths and cycles, and show that any weighted oriented tree with a unique sink has the IDP.
Source: arXiv (Cornell University)
Institution: Hobart and William Smith Colleges
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7226017978
