Sums of algebraic dilates
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908503821516800 |
|---|---|
| author | Conlon, David Lim, Jeck |
| author_facet | Conlon, David Lim, Jeck |
| contents | We show that if $λ_1,\ldots,λ_k$ are algebraic numbers, then $$|A+λ_1\cdot A+\dots+λ_k\cdot A|\geq H(λ_1,\ldots,λ_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where $H(λ_1,\ldots,λ_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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18586 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sums of algebraic dilates Conlon, David Lim, Jeck Combinatorics Number Theory 05D99, 11B13, 11B75, 11P21 We show that if $λ_1,\ldots,λ_k$ are algebraic numbers, then $$|A+λ_1\cdot A+\dots+λ_k\cdot A|\geq H(λ_1,\ldots,λ_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where $H(λ_1,\ldots,λ_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. |
| title | Sums of algebraic dilates |
| topic | Combinatorics Number Theory 05D99, 11B13, 11B75, 11P21 |
| url | https://arxiv.org/abs/2508.18586 |