arXiv (All)
open access
A counterexample to Nagamochi's scoring lemma and a new rectangle packing bound
Let $s(N)$ denote the smallest side length of a square containing $N$ unit squares with arbitrary orientations and pairwise disjoint interiors. Nagamochi's Packing Unit Squares in a Rectangle (2005) states a rectangle packing bound from which he deduces two infinite families of exact values: $s(k^2-
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
- Lonely Runner Relations#973852
- Positive formulas for q-Zeta numerators of Ferrers-cell posets#1050955
- Asymptotically optimal packings of arithmetic progressions with prime differences#984405
- Exact Ordered Ruzsa-Szemeredi Numbers for Matchings of Size Two#609128
- Counterexamples to a conjecture of Kamenetsky on OEIS A173419#1076169
Record · ID 1141732
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