Metraipolis › archive › dc_797a3fc8b677

New Upper bounds on the Mondrian Art Problem — arXiv:2609.01998

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01998
License (as archived)
CC0-1.0
Archived
2026-10-17T05:32:53.574Z
SHA-256 of the archived text
9f79d59a180b20264a2fb221736cf22f5368e7481e27320a20e6543b16f80666
Stable URL of this page
https://metraipolis.com/documento/dc_797a3fc8b677

How to cite

New Upper bounds on the Mondrian Art Problem — arXiv:2609.01998 — arXiv (en), https://arxiv.org/abs/2609.01998 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_797a3fc8b677 (Metraipolis archive dc_797a3fc8b677, sha256 9f79d59a180b20264a2fb221736cf22f5368e7481e27320a20e6543b16f80666)
BibTeX
@misc{dc797a3fc8b677,
  title = {New Upper bounds on the Mondrian Art Problem — arXiv:2609.01998},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01998},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_797a3fc8b677; sha256 9f79d59a180b20264a2fb221736cf22f5368e7481e27320a20e6543b16f80666},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01998. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 any $n \times n$ square, there exists a partition with defect $O(n^{5/6})$, improving upon the previously conjectured $O (n/\log n)$ upper bound. We also implement an algorithm that provides empirical evidence supporting our theoretical bound.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.01998 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T04:59:51.768Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).