arXiv (OAI Expanded)
open access
On the covering of $n + ε$ square with $n^2 + 1$ unit squares for $n \geq 4$
In 2006, Alexander Soifer conjectured that one cannot fully cover a square of side length $> n$ with $n^2 + O(1)$ unit squares. For small $n \in \{2, 3\}$, in 2009, Janusz Januszewski proved that it is impossible to fully cover a square of side length $> n$ with exactly $n^2 + 1$ unit squares. Recen
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Cone Restriction Estimates in Higher Dimensions#1142527
- The Conceptualization of Time in Vladimir Nabokov’s Pale Fire#747054
- An algebraic proof of Colombo's difference-power determinant conjecture#792293
- An algebraic proof of Colombo's difference-power determinant conjecture#788293
- Prime Hasse principles via diophantine second moments#405959
Record · ID 1109912
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive