Given a square with integer side length n, we ask for the number of different ways to divide it into sub-squares, considering only the list of parts. We enumerate all possible lists and check whether a placement with those squares is possible. In order to do this, we propose a new algorithm for creating perfect square packings.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:20863 |
| Date | 10 February 2018 |
| Creators | Langenau, Holger |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/submittedVersion, doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0014 seconds