Some properties of the singular words of the Fibonacci word.
Ce travail consiste à étudier les comportements des marches sur les arbres homogènes suivant la suite engendrée par une substitution. Dans la première partie, on étudie d’abord les marches sans orientation sur et on détermine complètement, d’après les propriétés combinatoires de la substitution, les conditions assurant que les marches sont bornées, récurrentes ou transientes. Comme corollaire, on obtient le comportement asymptotique des sommes partielles des coefficients de la suite substitutive....
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Let g be a doubling gauge. We consider the packing measure and the packing premeasure in a metric space X. We first show that if is finite, then as a function of X, has a kind of “outer regularity”. Then we prove that if X is complete separable, then for every Borel subset B of X, where the supremum is taken over all compact subsets of B having finite -premeasure, and λ is a positive number depending only on the doubling gauge g. As an application, we show that for every doubling gauge...
In this paper, we characterize the substitutions over a three-letter alphabet which generate a ultimately periodic sequence.
Let be a substitution over a 2-letter alphabet, say . If and begin with and respectively, has two fixed points beginning with and respectively. We characterize substitutions with two cofinal fixed points (i.e., which differ only by prefixes). The proof is a combinatorial one, based on the study of repetitions of words in the fixed points.
Let be a self-similar set with similarities ratio and Hausdorff dimension , let be a probability vector. The Besicovitch-type subset of is defined as where is the indicator function of the set . Let and be a gauge function, then we prove in this paper:(i) If , then moreover both of and are finite positive;(ii) If is a positive probability vector other than , then the gauge functions can be partitioned as follows ...
Let be the Thue-Morse sequence, i.e., the sequence defined by the recurrence equations: We consider , the double sequence of Hankel determinants (modulo 2) associated with the Thue-Morse sequence. Together with three other sequences, it obeys a set of sixteen recurrence equations. It is shown to be automatic. Applications are given, namely to combinatorial properties of the Thue-Morse sequence and to the existence of certain Padé approximants of the power series .
Page 1