The almost one-to-one coding conjecture for Pisot automorphisms

About 21 years old · traced to

Let an automorphism be represented by f(x)f(x), and call it a Pisot automorphism if f(x)f(x) or f(1/x)f(1/x) is, up to a sign, monic and irreducible with a Pisot root β\beta; this β\beta is its associated Pisot number. Let SβS_\beta denote the symbolic coding associated with the Pisot number β\beta, and call a coding almost 11-to-11 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 β\beta admits an almost 11-to-11 coding by SβS_\beta.

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.

References

Primary source

Alex Clark and Robbert Fokkink, “Self Duality and Codings for Expansive Group Automorphisms”, arXiv:math/0501469 (2005).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.