The Demonstration Minimally Squared Rectangles divides a rectangle into a minimal number of integersided squares. For example, a rectangle can be divided into no fewer than 12 squares, so let . The minimal squaring conjecture implies that for any integer multiple , the same number of squares will be needed, or . This Demonstration shows examples where in the bestknown dissections. Some of the smaller rectangles presented here are likely not minimal (see Details), and those would not be actual counterexamples, perhaps 30% by the oblong conjecture [1]. It is also very likely that at least one of the examples presented here is a true counterexample. The number of squares and the rectangle dimensions are shown above each figure.
The conjecture has been verified for all rectangles with as shown at [2]. The method there uses Young tableaux theory, which gets very slow above size 380. At [3], many squared rectangles are available that were built with the method of electrical resistance on a graph. Kirchhoff's first law is that except at a pole, the sum of the currents for any node is zero. A given graph leads to a squared rectangle, where the horizontal edges correspond to nodes and squares correspond to edges. For each horizontal edge, the sum of the squares directly over an edge squares the sum of squares directly under the edge. Perusing the squared rectangles available yielded many possible counterexamples to the minimal squaring conjecture. The rectangles at [4] are based on planar 3connected graphs. For 6 to 13 edges, there are 1, 0, 1, 2, 2, 4, 12, 22 such graphs ([5, A002840]). But it is possible to build rectangles from planar 2connected graphs that have a count of 3, 7, 15, 39, 106, 316, 1026, 1643 ([5, A289471]) for 6 to 13 edges. The rectangles based on 2connected graphs always feature two neighboring squares of the same size. [2] B. Felgenhauer. "Filling Rectangles with IntegerSided Squares." (Jul 11, 2017) inte.eu/~bf3/squares.
