Indexed metadata

On the covering of n+εn + ε square with n2+1n^2 + 1 unit squares for n4n \geq 4

Sira Sriswasdi

Source record

Source: arXiv

Published: Sep 14, 2026

arXiv: 2609.15876

Open original source ↗

Source abstract

In 2006, Alexander Soifer conjectured that one cannot fully cover a square of side length >n> n with n2+O(1)n^2 + O(1) unit squares. For small n{2,3}n \in \{2, 3\}, in 2009, Janusz Januszewski proved that it is impossible to fully cover a square of side length >n> n with exactly n2+1n^2 + 1 unit squares. Recently in 2023, Baek and Lee proved that it is impossible to fully cover an equilateral triangle of side length >n> n with exactly n2+1n^2 + 1 unit equilateral triangles whose sides are parallel to it. There were also some progress on a related problem: what is the largest square with side length S(k)S(k) that can be fully covered by kk unit squares. However, there have been no improvement on the original conjecture. In this work, new tools have been developed that led to the proof of this conjecture for n=4n = 4, with potential applications to related problems.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

On the covering of $n + ε$ square with $n^2 + 1$ unit squares for $n \geq 4$ — Mathematical Frontier Network