ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \textscSquares\textsc{Squares} denote the set of perfect squares in Z\mathbb Z. Finite-translate perfect-squares conjecture. There exists a positive integer kk such that there are no sets X,Y⊂ZX,Y\subset\mathbb Z with ∣X∣=∣Y∣=k|X|=|Y|=k satisfying

x+y∈\textscSquaresfor all x∈X and y∈Y.x+y\in\textsc{Squares}\quad\text{for all }x\in X\text{ and }y\in Y.

This asks whether the maximum number of translates of a fixed-size set of integers into the perfect squares is finite for some size. Such a bound would have consequences for sum-product exponents on sparse graphs; the problem is stated as open.

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.