arXiv (OAI)
open access
Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
combinatoricscomputational-complexitycomputational-geometrydata-structures-and-algorithmsdiscrete-mathematics
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 Four Color Theorem meets Shapes of Polyhedra#1118521
- Size Ramsey Numbers Involving Double Stars and Brooms#492255
- A 21-Coloring of the Plane Without Monochromatic Unit-Area Rectangles#820016
- An Independent Border-Free Type-A Cover of Q221 and Improved Asymptotic Bounds for Queen Domination#821546
- Sets of subspaces with restricted hyperplane intersection numbers#985035
Record · ID 144227
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