Sums of algebraic dilates
Combinatorics
2025-08-27 v1 Number Theory
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.
Cite
@article{arxiv.2508.18586,
title = {Sums of algebraic dilates},
author = {David Conlon and Jeck Lim},
journal= {arXiv preprint arXiv:2508.18586},
year = {2025}
}
Comments
49 pages