Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

Approximation properties of β-expansions

Simon Baker — 2015

Acta Arithmetica

Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence ( ϵ i ) i = 1 0 , 1 a β-expansion for x if x = i = 1 ϵ i β - i . We call a finite sequence ( ϵ i ) i = 1 n 0 , 1 n an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given Ψ : 0 , we introduce the following subset of ℝ: W β ( Ψ ) : = m = 1 n = m ( ϵ i ) i = 1 n 0 , 1 n [ i = 1 n ( ϵ i ) / ( β i ) , i = 1 n ( ϵ i ) / ( β i ) + Ψ ( n ) ] In other words, W β ( Ψ ) is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities 0 x - i = 1 n ( ϵ i ) / ( β i ) Ψ ( n ) . When n = 1 2 n Ψ ( n ) < , the Borel-Cantelli lemma tells us that the Lebesgue measure of W β ( Ψ ) is...

The growth rate and dimension theory of beta-expansions

Simon Baker — 2012

Fundamenta Mathematicae

In a recent paper of Feng and Sidorov they show that for β ∈ (1,(1+√5)/2) the set of β-expansions grows exponentially for every x ∈ (0,1/(β-1)). In this paper we study this growth rate further. We also consider the set of β-expansions from a dimension theory perspective.

On univoque points for self-similar sets

Simon BakerKarma DajaniKan Jiang — 2015

Fundamenta Mathematicae

Let K ⊆ ℝ be the unique attractor of an iterated function system. We consider the case where K is an interval and study those elements of K with a unique coding. We prove under mild conditions that the set of points with a unique coding can be identified with a subshift of finite type. As a consequence, we can show that the set of points with a unique coding is a graph-directed self-similar set in the sense of Mauldin and Williams (1988). The theory of Mauldin and Williams then provides a method...

Page 1

Download Results (CSV)