References

References

Primary sources are archived locally under resources/; the citation keys below resolve there and in the per-case frontier/ artifacts. Each entry names what this project relies on it for.

  • Stromquist, W. (2003). Packing 10 or 11 Unit Squares in a Square. Electronic Journal of Combinatorics 10(1), R8. Supplies s(10), states the s(11) lower-bound value, and proves the 0∘/45° class bound. Exp-016 refutes its printed unrestricted Figure 14 cover; exp-017 independently certifies the same value with a source-distinct repair.
  • Trump, W. (1979). The n=11 packing, as published on the Squares in Squares record page with Ellsworth’s exact solution in the SVG source. The standing upper bound.
  • Friedman, E. (2009). Packing Unit Squares in Squares: A Survey and New Results. Electronic Journal of Combinatorics, DS7. The survey the corpus is checked against.
  • Erdős, P. and Graham, R. L. (1975). On Packing Squares with Equal Squares. The asymptotic waste line of work.
  • Nagamochi, H. (2005). Packing Unit Squares in a Rectangle. The general closed-form lower bound used where the register has no stronger formal evidence.
  • Montanher, T. et al. (2018). Rigorous Packing of Unit Squares into a Circle. The only rigorous computer-assisted optimality proof for rotatable unit squares in any container, and the scope limit on what sqpack claims.
  • Doye, J. P. K., Miller, M. A. and Wales, D. J. (1999). The Double-Funnel Energy Landscape of the 38-Atom Lennard-Jones Cluster. The precedent behind the rarity premise.
  • Stillinger, F. H. and Weber, T. A. (1982). Hidden Structure in Liquids. The decomposition T-2 supplies a cell-exact version of.
  • Mouret, J.-B. and Clune, J. (2015). Illuminating Search Spaces by Mapping Elites. The precedent behind H-015.