We show that if are algebraic numbers, then for all finite subsets of , where is an explicit constant that is best possible. The proof combines several ingredients, including a lower bound estimate on the measure of sums of linear transformations of compact sets in , a variant of Freiman’s theorem tuned specifically to sums of dilates and the analysis of what we call lattice density, which succinctly captures how a subset of is arranged relative to a given flag of lattices. As an application, we revisit the study of sums of linear transformations of finite sets, in particular proving an asymptotically best possible lower bound for sums of two linear transformations.

生成讲解博客的中文版本

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