Decompositions of a rectangle into non-congruent rectangles of equal area
MetadataShow full item record
In this paper, we deal with a simple geometric problem: Is it possible to partition a rectangle into k non-congruent rectangles of equal area? This problem is motivated by the so-called 'Mondrian art problem' that asks a similar question for dissections with rectangles of integer sides. Here, we generalize the Mondrian problem by allowing rectangles of real sides. In this case, we show that the minimum value of k for a rectangle to have a 'perfect Mondrian partition' (that is, with non-congruent equal-area rectangles) is seven. Moreover, we prove that such a partition is unique (up to symmetries) and that there exist exactly two proper perfect Mondrian partitions for k=8. Finally, we also prove that any square has a perfect Mondrian decomposition for k >= 7.
Is part ofDiscrete Mathematics, 2021, vol. 344, num. 6, p. 112389
European research projects
The following license files are associated with this item:
Showing items related by title, author, creator and subject.
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier, 2017)A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line ...
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier B.V., 2018)A mixed graph G can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a ...
Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier, 2021)The Mondrian problem consists of dissecting a square of side length n ∈ N into non-congruent rectangles with natural length sides such that the difference d(n) between the largest and the smallest areas of the rectangles ...