arXiv (All)
open access
An Algebraic Approach to the Arithmetic of Square Tilings
It is a classical result dating back to Dehn (1903) that squares tiling a rectangle must have rational side lengths. However, bounding the arithmetic complexity of these tilings, specifically the growth of their denominators, is an active area of research. Recent contributions have tackled these ari
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
- A Sparse Corner-Difference MILP for Minimum Square Tiling#1035855
- Efficient Compression in Semigroups#1084110
- Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case#1084316
- 42 U.S.C. § 16277 — High-performance computation and supportive research#589012
- Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane#1051626
Record · ID 986854
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