arXiv (All)
open access
Packing Tails of Reciprocal Rectangles into Squares of Equal Area
The Meir--Moser rectangle-packing problem asks whether all rectangles with side lengths \(1/n\) and \(1/(n+1)\), for \(n\ge1\), can be packed into the unit square with pairwise disjoint interiors. We establish a tail version of this problem. Let \(R_n\) denote the rectangle with these side lengths.
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
- New Upper bounds on the Mondrian Art Problem#822406
- Locating-dominating partitions for some classes of graphs#147107
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
- Nearly Tight Bounds for Proportional Group Fair Divisions and One-Sided Discrepancy#926577
- Transport-Noise Witnesses of Electronic Multipartite Entanglement#617701
Record · ID 1076447
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