Abstract
Let be real numbers in and be points in . Consider the collection of maps given by It is a well known result that there exists a unique compact set satisfying Each has at least one coding, that is a sequence that satisfies We study the size and complexity of the set of codings of a generic when has positive Lebesgue measure. In particular, we show that under certain natural conditions almost every has a continuum of codings. We also show that almost every has a universal coding. Our work makes no assumptions on the existence of holes in and improves upon existing results when it is assumed contains no holes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.