By David Feldman and others

Our earlier article proved that if *n > 1* translates of sublattices of *Z^d* tile *Z^d*, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. We re-prove this Theorem, this time using generating functions. We also show that... Show more

June 3, 2010

Loading full text...

Similar articles

Loading recommendations...

x1

Tiling Lattices with Sublattices, II

Click on play to start listening