2000 character limit reached
Sums of algebraic dilates
Published 26 Aug 2025 in math.CO and math.NT | (2508.18586v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.