2 problems

Zero–infinity conjecture for packing measures of non-almost-deterministic random code-tree attractors
Let $bbL$ be a family of iterated function systems satisfying the UOSC and Condition. Let $bbP$ be a random code-tree measure, and assume that $F_\tau$ is not almost deterministic.…
openpacking-measure random-fractals self-similar-sets
0 responses
08
Packing measure formula for regular-polygon self-similar sets
Regular-polygon packing measure formula. The conjectured packing measure satisfies
openfractal-geometry packing-measure self-similar-sets
0 responses
04

Zero–infinity conjecture for packing measures of non-almost-deterministic random code-tree attractors