Biased-normal characterization of attractor-generating sequences
Biased-normal characterization of attractor-generating sequences
Let be a compact metric space, and let be a hyperbolic iterated function system (IFS) with probabilities. Let be its invariant measure, whose support is the IFS attractor. For a sequence used by the determined iteration algorithm, let be the set of sequences for which every Borel subset with null boundary is visited with limiting frequency .
Attractor-generation conjecture. Given a hyperbolic IFS with probabilities, a sequence is an element of —that is, generates the attractor of the IFS as described above—if and only if is biased normal with respect to the probabilities of the IFS.
The conjecture seeks an exact characterization of the sequences that reproduce the invariant-measure frequencies, and hence the attractor, under determined iteration. The surrounding text records that sequences with the matching Bernoulli measure belong to almost surely, but gives no proof of the proposed if-and-only-if characterization.
Sources & referencesView supporting material
Primary source
Andrew DeLapo, “Bernoulli Randomness and Biased Normality”, arXiv:2007.01854 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.