Projections of cartesian products of the self-similar sets without the irrationality assumption
Abstract
Let β>1. Define a class of similitudes \[S=\fi(x)=xβni+ai:ni∈ N+, ai∈ R\.\] Let A be the collection of all the self-similar sets generated by the similitudes from S. In this paper, we prove that for any θ∈(0,π) and K1, K2∈ A, Projθ(K1× K2) is similar to a self-similar set or an attractor of some infinite iterated function system, where Projθ denotes the orthogonal projection onto Lθ, and Lθ denotes the line through the origin in direction θ. As a corollary, P(Projθ(K1× K2))=B(Projθ(K1× K2)) holds for any θ∈(0,π) and any K1, K2∈ A, where P and B denote the packing and upper box dimension. Whether Projθ(K1× K2) is similar to a self-similar set or not is uniquely determined by the similarity ratios of K1 and K2 rather than the angle θ. When Projθ(K1× K2) is similar to a self-similar set, in terms of the finite type condition NW, we are able to calculate in cerntain cases the Hausdorff dimension of Projθ(K1× K2). If Projθ(K1× K2) is similar to an attractor of some infinite iterated function system, then by virtue of the Vitali covering lemma FG we give an estimation of the Hausdorff dimension of Projθ(K1× K2). For some cases, we can calculate, by means of Mauldin and Urbanski' result MRD, the exact Hausdorff dimension of Projθ(K1× K2). We also find some non-trivial examples such that for some angle θ∈[0,π) and some K1, K2∈ A, H(Projθ(K1× K2))=H(K1)+H(K2).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.