Krachun--Petrov conjecture on sums with an algebraic multiplier

Let λ\lambda be a real algebraic number. Write its minimal polynomial as f(x)=i=1d(aix+bi)f(x)=\prod_{i=1}^d(a_i x+b_i) over the complex numbers, with coprime integer coefficients, and define H(λ)=i=1d(ai+bi)H(\lambda)=\prod_{i=1}^d(|a_i|+|b_i|). Krachun--Petrov's conjecture.

limnminAR, A=nA+λAA=H(λ).\lim_{n\to\infty}\min_{A\subset\mathbb{R},\ |A|=n}\frac{|A+\lambda\cdot A|}{|A|}=H(\lambda).

This conjecture generalizes the sharp asymptotic lower bound known for λ=2\lambda=\sqrt{2}; the source notes that Krachun and Petrov prove the matching upper bound, while the general lower bound is the subject of the conjecture.

Sources & referencesView supporting material

Primary source

David Conlon and Jeck Lim, “Sums of linear transformations”, arXiv:2203.09827 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.