arXiv (All)
open access
New Upper bounds on the Mondrian Art Problem
We present a new upper bound on the defect of the Mondrian Art Problem. The Mondrian Art Problem asks for a partition of an $n \times n$ square with rectangles of distinct dimensions such that the difference (defect) between the largest and smallest rectangle areas is minimized. We prove that for an
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
- Packing Tails of Reciprocal Rectangles into Squares of Equal Area#1076447
- An analogue of a problem of Littlewood#490218
- Extremal problems for cancellative and locally thin hypergraphs#986484
- The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case#998661
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
Record · ID 822406
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