Papers › There is no perfect Mondrian partition for squares of side lengths less than 1001
There is no perfect Mondrian partition for squares of side lengths less than 1001
Natalia García-Colín, Dimitri Leemans, Mia Müßig, Érika Roldán
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In mathematics, a dissection of a square (or rectangle) into non-congruent rectangles is a Mondrian partition. If all the rectangles have the same area, it is called a perfect Mondrian partition. In this paper, we present a computational result by which we can affirm that there is no perfect Mondrian partition of a length n square for n≤1000. Using the same algorithm we have been able to establish that there is no perfect Mondrian partition of a n ×m rectangle for n,m ≤400.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections