The almost one-to-one coding conjecture for Pisot automorphisms
Statement
Let an automorphism be represented by , and call it a Pisot automorphism if or is, up to a sign, monic and irreducible with a Pisot root ; this is its associated Pisot number. Let denote the symbolic coding associated with the Pisot number , and call a coding almost -to- if it has singleton fibers over a subset of full Haar measure.
Almost one-to-one coding conjecture. A Pisot automorphism with associated Pisot number admits an almost -to- coding by .
This generalizes Schmidt's conjecture on codings for Pisot units. The statement is motivated by results of Schmidt, and by Sidorov and Vershik for a wider class of Pisot units including all quadratic units; Sidorov reduced the conjecture to algebraic considerations. Its general status is not specified in the source.
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.