arXiv (All)
open access
Log-concavity and Approximate Counting for Totally Unimodular Polytopes
We present a new lower bound on the number of lattice points of all totally unimodular polytopes, generalizing previous lower bounds on contingency tables, integer flows, and beyond. Our bound is based on the Gurvits capacity convex optimization problem, and thus our result implies an efficient dete
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
- The maximum number of maximal dissociation sets in trees#625210
- The maximum number of maximal dissociation sets in trees#622937
- A construction of Kakeya Sets in Arbitrary Dimension#1014769
- Bridge numbers of virtual graphs and handlebody-links#974941
- A universal threshold for geometric embeddings of trees#149263
Record · ID 1145084
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