SearcharxivSearch

arXiv · 1511.05411

Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule

Abstract

It is well-known that the constructions of space-filling curves depend on certain substitution rules. For a given self-similar set, finding such rules is somehow mysterious, and it is the main concern of the present paper. Our first idea is to introduce the notion of skeleton for a self-similar set. Then, from a skeleton, we construct several graphs, define edge-to-trail substitution rules, and explore conditions ensuring the rules lead to space-filling curves. Thirdly, we summarize the classical constructions of the space-filling curves into two classes: the traveling-trail class and the positive Euler-tour class. Finally, we propose a general Euler-tour method, using which we show that if a self-similar set satisfies the open set condition and possesses a skeleton, then space-filling curves can be constructed. Especially, all connected self-similar sets of finite type fall into this class. Our study actually provides an algorithm to construct space-filling curves of self-similar sets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xi-rong Dai, Hui Rao, Shu-qin Zhang. 2018-04-23. Space-filling curves of self-similar sets (II): Edge-to-trail substitution rule. https://arxiv.org/abs/1511.05411

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN