arXiv (All)
open access
Monotone Diameters of Lattice Polytopes
An influential 1989 result of Naddef shows that the diameters of $0/1$-polytopes are at most their dimension. This was extended shortly after by Kleinschmidt and Onn to any lattice polytope in $[0,k]^{d}$, where they showed a bound of at most $dk$. Naddef's argument easily extends to the monotone se
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Minimal-Volume Equiangular Hyperbolic $4$-Polytopes#927558
- Exact volume computation for Boolean quadric polytopes of series-parallel graphs#1155669
- A polylogarithmic higher-order Cheeger inequality#1129961
- Godbersen's conjecture and the $L_p$-Rogers-Shephard inequality#1109107
- Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration#1130738
Record · ID 985981
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive