ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 4.8 (I. Łaba). Suppose that α\alpha is transcendental, and ∣A∣=n|A|=n. What is the best lower bound for ∣A+αA∣|A+\alpha A|?

Remark(s). Konyagin and Łaba have shown that this cardinality is

≫nlog⁡nlog⁡log⁡n.\gg \frac{n\log n}{\log\log n}.

The best example (lowest known cardinality) is

neclog⁡n.n e^{c\sqrt{\log n}}.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.