Countable Alphabet Non-autnomous Self-affine Sets
نویسندگان
چکیده
We extend Falconer’s formula from [1] by identifying the Hausdorff dimension of the limit sets of almost all contracting affine iterated function systems to the case of an infinite alphabet, non-autonomous choice of iterating matrices, and time dependent random choice of translations.
منابع مشابه
Embedding a $\theta$-invariant code into a complete one
Let A be a finite or countable alphabet and let θ be a literal (anti)morphism onto A∗ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under θ (θ-invariant for short). We establish a formula which allows to embed any non-complete θ-invariant code into a complete one: this brings a positive answer to the open ...
متن کاملCOUNTABLE COMPACTNESS AND THE LINDEL¨OF PROPERTY OF L-FUZZY SETS
In this paper, countable compactness and the Lindel¨of propertyare defined for L-fuzzy sets, where L is a complete de Morgan algebra. Theydon’t rely on the structure of the basis lattice L and no distributivity is requiredin L. A fuzzy compact L-set is countably compact and has the Lindel¨ofproperty. An L-set having the Lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
متن کاملInfinite Excess Entropy Processes with Countable-State Generators
We present two examples of finite-alphabet, infinite excess entropy processes generated by invariant hidden Markov models (HMMs) with countable state sets. The first, simpler example is not ergodic, but the second is. It appears these are the first constructions of processes of this type. Previous examples of infinite excess entropy processes over finite alphabets admit only invariant HMM prese...
متن کاملAdaptive compression against a countable alphabet
This paper sheds light on universal coding with respect to classes of memoryless sources over a countable alphabet defined by an envelope function with finite and non-decreasing hazard rate. We prove that the auto-censuring (AC) code introduced by Bontemps (2011) is adaptive with respect to the collection of such classes. The analysis builds on the tight characterization of universal redundancy...
متن کاملOverlapping Self-affine Sets
We study families of possibly overlapping self-affine sets. Our main example is a family that can be considered the self-affine version of Bernoulli convolutions and was studied, in the non-overlapping case, by F. Przytycki and M. Urbański [23]. We extend their results to the overlapping region and also consider some extensions and generalizations.
متن کامل