arXiv (All)
open access
Exact Area-Range Minima in the Quantitative Monsky Problem for Five and Seven Triangles
For a dissection $D$ of the unit square into $n$ nondegenerate triangles, let $R(D)=\max_i a_i-\min_i a_i, Δ(n)=\inf_D R(D).$ We prove that this infimum is attained for every $n\ge2$, and determine the exact minima for $n=5$ and $n=7$, allowing T-junctions. For five triangles, $Δ(5)=\frac{5\sqrt5-11
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
- Extending Exact Integrality Gap Computations for the Metric TSP#986210
- The Truncated Octahedral Conjecture#1070484
- Balanced Support Calibrations for Moser's Worm Problem: Exact Certificate and Bound of Triangular Cover#927865
- Vertex Classification of Planar C-polygons#182977
- Calculus of the Facial Distance#793199
Record · ID 1037376
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