Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded) open access

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

Sriswasdi, Sira
arXiv (OAI Expanded) · Papers
Open Source ↗Direct PDF ↓
combinatoricsmetric-geometry
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

Record · ID 1109912
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