{"id":"hexagon/2611.00683","pdf":"https://hexagonmath.org/pdf/2611.00683v1","url":"https://hexagonmath.org/abs/2611.00683v1","tags":["msc:05B45","Chinese remainder theorem","Hanoi tilings","square dissections"],"score":0,"title":"Hanoi tilings with a prescribed number of bottom squares","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"math.CO","summary":"For each fixed integer $k\\geq 2$, every sufficiently large integer square admits a Hanoi tiling with exactly $k$ squares on its bottom edge. We construct nearly equal columns from two coprime widths and prove a rectangle lemma to fill their remaining height.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-20","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}