Periodic solutions and decidability for signed integer tilings
Let \(f\) be a finitely supported integer function on \(\mathbb{Z}^{d}\) and \(g\) a fully periodic integer function. We prove that whenever \(f*a=g\) has a bounded integer solution, it has a fully periodic integer solution. Bounded integer solvability is decidable in every finite dimension. These results answer two questions of Greenfeld and Tao. More precisely, given a finite set containing the support of \(f\) and a scalar period of \(g\), one can compute a single finite torus on which solvability can be tested for all choices of the coefficients of \(f\) and the values of \(g\). The proof uses torsion cosets of the convolution symbol to describe the fractional parts of homogeneous corrections. On parallel lattice slices these residues form compact groups. A periodic choice of residues lifts to an integer solution with the prescribed right-hand side.
Authors
- Sam Vaseghi (ORCID: https://orcid.org/0009-0006-4105-1949)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24425658
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint