Sums of algebraic dilates

TL;DR

This paper establishes optimal lower bounds for the size of sumsets involving algebraic dilates in the complex plane, combining geometric, additive combinatorics, and lattice analysis techniques.

Contribution

It introduces a new lower bound estimate for sumsets with algebraic dilates, utilizing a novel lattice density concept and a specialized version of Freiman's theorem.

Findings

Proves a sharp lower bound for sumsets with algebraic dilates in complex numbers.

Develops a measure estimate for sums of linear transformations of compact sets.

Provides an asymptotically optimal bound for sums involving two linear transformations.

Abstract

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where $H(\lambda_1,\ldots,\lambda_k)$ 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 $\mathbb{R}^d$, 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 $\mathbb{Z}^d$ 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.