Finite-translate perfect-squares conjecture
Statement
Let denote the set of perfect squares in . Finite-translate perfect-squares conjecture. There exists a positive integer such that there are no sets with satisfying
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.