| Abstract: | ![]()
The problem of covering an n-dimensional  torus with n-dimensional grid graphs is studied. This is the dual problem of a packing problem concerningthe capacity of a graph, which has been studied in information theory. It is related to severalother problems as well, including weighted coverings, Keller s cube-tiling problem, and the recreationalproblem of how to obtain zero correct predictions in the football pools. Motivated by thelast problem, bounds on the minimum size of such coverings are tabulated for q = 3, p = 2, andsmall n.AMS Subject Classification: 05C70, 94B25. |
