A representation-sensitive decidability dichotomy for integer rotation constraints
Statement
Question 25. Is there an algorithm to decide solubility of a system of linear equations
ai1x1 + · · · + ain xn = bi
for ai, b, x i ∈ Z, together with equations of the form
{xiαj } < r j
for αj ∈ R \ Q, ri ∈ Q? (Poonen)
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.