ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every c,ε>0c,\varepsilon>0, is there an n0n_0 such that whenever n≥n0n\geq n_0, AA is an nn-element set of integers, and GG is a graph on AA with at least n1+cn^{1+c} edges, one has max⁡{∣A+GA∣,∣A⋅GA∣}≥n1+c−ε,\max\{|A+_G A|,|A\cdot_G A|\}\geq n^{1+c-\varepsilon}, where the two sets contain the sums and products along the edges of GG?

Record

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.