A workshop report describing three gamified research outreach activities and claiming new extremal fence results whose proofs are deferred to an unpublished companion paper.
There is no perfect Mondrian partition for squares of side lengths less than 1001
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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\leq 1000$. Using the same algorithm we have been able to establish that there is no perfect Mondrian partition of a $n \times m$ rectangle for $n,m \leq 400$.
fields
math.HO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Insights from a workshop on gamification of research in mathematics and computer science
A workshop report describing three gamified research outreach activities and claiming new extremal fence results whose proofs are deferred to an unpublished companion paper.