Pisot-condition thresholds for classical multidimensional continued fraction algorithms
Statement
Consider the Brun, Jacobi--Perron, and Selmer multidimensional continued fraction algorithms in dimension . The convergence-threshold conjecture. The Brun algorithm satisfies the Pisot condition if and only if ; the Jacobi--Perron algorithm satisfies the Pisot condition if and only if ; and the Selmer algorithm satisfies the Pisot condition if and only if . These are heuristic predictions about the dimension ranges in which the relevant algorithms satisfy the Pisot condition. The source presents them as conjectural convergence behavior.
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.