{"paper":{"title":"Random affine code tree fractals and Falconer-Sloan condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.DS","authors_text":"Bing Li, Esa J\\\"arvenp\\\"a\\\"a, Maarit J\\\"arvenp\\\"a\\\"a, \\\"Orjan Stenflo","submitted_at":"2014-04-09T13:04:52Z","abstract_excerpt":"We calculate the almost sure dimension for a general class of random affine code tree fractals in $\\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \\cite{FS}. We verify that, in general, systems having a small number of maps do not satisfy condition $C(s)$. However, there exists a natural number $n$ such that for typical systems the family of all iterates up to level $n$ satisfies condition $C(s)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2473","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}