arXiv (OAI Expanded)
open access
Combinatorial slicing problems of polytopes: How (not) to reconstruct a polytope from its slices
We study combinatorial aspects of hyperplane sections of polytopes, focusing on how much the combinatorics of the sections determines the combinatorics of the original polytope. We show that, in general, combinatorial information about the sections is not enough to determine even the $f$-vector of t
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
- Linear-Time FPT Algorithm for Surface Disjoint Paths via Surface Cutting#1077253
- Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover#1082916
- The Complexity of Recognizing SDP Exactness for the Maximum Cut Problem#1123200
- On the Face Map of the Admissible Set With Iwahori Level#1036701
- Three-Layer Intersecting Temperate Families#1051150
Record · ID 1110572
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