Algebraic and Analytic Methods in Combinatorics: Sums of algebraic dilates
Presenter
March 19, 2025
Keywords:
- extremal combinatorics
- extremal graph theory
- probabilistic combinatorics
- discrete geometry
- additive combinatorics
- combinatorial geometry
- incidence geometry
- arithmetic progressions
- Discrete analysis
MSC:
- 05C25 - Graphs and abstract algebra (groups rings fields
- etc.) [See also 20F65]
- 05C35 - Extremal problems in graph theory [See also 90C35]
- 05C50 - Graphs and linear algebra (matrices eigenvalues etc.)
- 05D40 - Probabilistic methods in extremal combinatorics including polynomial methods (combinatorial Nullstellensatz etc.)
- 52C35 - Arrangements of points flats hyperplanes (aspects of discrete geometry) [See also 14N20 32S22]
Abstract
Given a real number λ and a finite set A of real numbers, how small can the size of the sum of dilate A + λ.A be in terms of |A|? If λ is transcendental, then |A + λ.A| grows superlinearly in |A|, whereas if λ is algebraic, then |A + λ.A| only grows linearly in |A|. There have been several works in recent years to prove optimal linear bounds in the algebraic case, but tight bounds were only known when λ is an algebraic integer or of the form (p/q)^{1/d}.
In this talk, we prove tight bounds for sums of arbitrarily many algebraic dilates |A + λ1.A + ... + λk.A|. We will discuss the main tools used in the proof, which include a Frieman-type structure theorem for sets with small sums of dilates, and a high-dimensional notion of density which we call "lattice density". Joint work with David Conlon.