arXiv (All)
open access
Perspectives on the unit distance problem
This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?
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
- Optimization hierarchies for extremal geometry through complete positivity#1129459
- Sylvester's four point problem for ball-convex bodies#799222
- Sylvester's four point problem for ball-convex bodies#797799
- Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality#1013989
- Qualitative convexity and universal cross-sections#1062032
Record · ID 997781
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