arXiv (All)
open access
Unilateral and Equitransitive Tilings by Squares of Sizes 1, 2, 3, and 4
In this article we examine a problem stated in Grübaum and Shephard's classic book on tiling theory, Tilings and Patterns, which asks the reader to find all unilateral and equitransitive tilings by squares of sizes $1, 2, 3, \ldots, n$ where $n \in \mathbb{N}$. The unilaterality condition requires t
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
- Problem 11402: Squares on Graphs#108232
- How hard is unshuffling a string?#787504
- On the Compactness of Tiling Spaces#999886
- Quantum n-coloring is undecidable for every n $\ge$ 3#1201293
- Periodic Joint Co-tiles of Independent Tiles#1154722
Record · ID 1247493
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