Effective semilinearity for polynomial zeros at powers of two
Statement
Question 8 (Pheidas). Is the following problem decidable: Given P (~x) ∈ Z[~x], do there exist n1,..., n m ∈ N such that P (2 n1,..., 2nm ) = 0?The answer is YES: this is related to the Mordell-Lang conjecture for tori.
Record
- Source
- Added
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.