Boston–Jones conjecture on settled elements in quadratic arboreal representations
Statement
Let be a quadratic polynomial, let , let be the binary tree, and let
be the associated arboreal representation. An element of its image is called settled when it has the settled-element property for the action on . Boston–Jones conjecture. The set of settled elements is dense in the image of . This conjecture concerns the abundance of elements with controlled behaviour on the levels of the binary tree and is part of the study of arboreal Galois representations. The supplied text gives no resolution, so the conjecture remains 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.