For lattices in with volume and pairwise trivial intersections, every nonzero common tiling function has support diameter , while for lattice families whose fundamental domains have uniformly bounded diameters, the standard convolution construction gives an upper bound, leaving a gap that has remained open since the work of Kolountzakis and Wolff \cite{kolwolff-1999Mathematika}. We close this gap by constructing, for every and all sufficiently large , lattice families satisfying the same volume and intersection conditions that admit a nonnegative common tiling function with support diameter , thereby also answering Question 1 of Kolountzakis and Papageorgiou \cite{kolPapageorgiou-functions-2022jfaa}. We also obtain the optimal upper bound by constructing, for any prescribed family of plane lattices whose volumes lie in a fixed bounded set independent of , a pairwise trivially intersecting family with the same respective volumes and with bases arbitrarily close to suitable bases of the prescribed lattices.

生成讲解博客的中文版本

生成AI智能校验的中文版本