Divisibility of integer polynomials and tilings of the integers
If \(A\) and \(B\) are sets of integers and every integer can be written as \(a+b\), \(a\in A\), \(b \in B\), in a unique way, we say that \(A\) tiles the integers when translated by \(B\). If this is the case and we assume that \(A\) is finite then it is well known that \(B\) is a periodic set and \textit{D. J. Newman} [``Tesselations of the integers, J. Number Theory 9, 107--111 (1977; Zbl 0348.10038)] first proved the upper bound \(2^D\) for the least period of \(B\), where \(D\) is the diameter of \(A\). The reviewer [Electron. J. Comb. 10, No. 1, R22 (2003; Zbl 1107.11016)] and \textit{I. Z. Ruzsa} [Appendix to \textit{R. Tijdeman}, Bolyai Soc. Math. Stud. 15, 381--405 (2006; Zbl 1103.68103)] have improved this to roughly \(2^{\sqrt{D \log D}}\) and in this paper the bound is further improved to \(2^{D^{1/3+\varepsilon}}\), for any positive \(\varepsilon\).
- Problems in additive number theory. II: Linear forms and complementing sets
- Values of modular functions at real quadratics and conjectures of Kaneko
- Class number one problem for the real quadratic fields \(\mathbb{Q}(\sqrt{m^2+2r})\)
- Covering and packing in \({\mathbb Z}^n\) and \({\mathbb R}^n\). I
- Indecomposable tilings of the integers with exponentially long periods
- The Coven-Meyerowitz tiling conditions for 3 odd prime factors
- On covering by translates of a set
- Periodicity of complementing multisets
- The structure of translational tilings in \(\mathbb{Z}^d\)
- Keller properties for integer tilings
- On the minimal period of integer tilings
- Tilings of the integers can have superpolynomial periods
This page was built for publication: Divisibility of integer polynomials and tilings of the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315166)
