Tiling Lattices with Sublattices, I
暂无分享,去创建一个
Call a coset C of a subgroup of ${\bf Z}^{d}$ a Cartesian coset if C equals the Cartesian product of d arithmetic progressions. Generalizing Mirsky–Newman, we show that a non-trivial disjoint family of Cartesian cosets with union ${\bf Z}^{d}$ always contains two cosets that differ only by translation. Where Mirsky–Newman’s proof (for d=1) uses complex analysis, we employ Fourier techniques. Relaxing the Cartesian requirement, for d>2 we provide examples where ${\bf Z}^{d}$ occurs as the disjoint union of four cosets of distinct subgroups (with one not Cartesian). Whether one can do the same for d=2 remains open.
[1] A. Soifer. The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators , 2008 .
[2] J. Propp,et al. Tiling Lattices with Sublattices, II , 2010, 1006.0472.
[3] Donald J. Newman. Analytic Number Theory , 1997 .
[4] S. Robins,et al. Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra , 2007 .
[5] Zhi-Wei Sun. On the Herzog–Schönheim conjecture for uniform covers of groups , 2003, math/0306099.