math.CO — Combinatorics
Boxes with cyclic tiling groups have one layer or size 2 × 2 × 4
Kuperberg asked how a box's dimensions determine its tiling group. We prove Conlon's conjecture that this group is cyclic exactly when one side has length one or the box has dimensions in some order. For every box, we also show that the minimum number of generators of its tiling group equals the largest multiplicity of a cyclotomic factor of prime-power index in MacMahon's volume polynomial. This polynomial counts stacks by the number of cubes they contain. It also determines the Smith factors over of the box's weighted Carlitz matrix, which presents the tiling group at . Each cyclotomic factor of multiplicity occurs in exactly the last Smith factors, once in each.
Primarily AI-generated textHuman understanding: some partsCyclotomic PolynomialsKasteleyn cokernelsSmith normal formboxed plane partitionslozenge tilings