Integer Decomposition Property of Edge Polytopes of Weighted Oriented Graphs

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17047
Primary Topic
Commutative Algebra and Its Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Integer Decomposition Property of Edge Polytopes of Weighted Oriented Graphs

Augustine O’Keefe, Jennifer Biermann, Kuei-Nuan Lin
arXiv (Cornell University)
Commutative Algebra and Its Applications
preprint

Integer Decomposition Property of Edge Polytopes of Weighted Oriented Graphs

Augustine O’Keefe, Jennifer Biermann, Kuei-Nuan Lin
preprint en

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.

arXiv (Cornell University)
Commutative Algebra and Its Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon