Related papers: Translating the Cantor set by a random
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We define the epsilon-distortion complexity of a set as the shortest program, running on a universal Turing machine, which produces this set at the precision epsilon in the sense of Hausdorff distance. Then, we estimate the…
We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…
A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…
Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective…
We investigate the question under which conditions the algebraic difference between two independent random Cantor sets $C_1$ and $C_2$ almost surely contains an interval, and when not. The natural condition is whether the sum $d_1+d_2$ of…
In 1994, John Cobb asked: given $N>m>k>0$, does there exist a Cantor set in $\mathbb R^N$ such that each of its projections into $m$-planes is exactly $k$-dimensional? Such sets were described for $(N,m,k)=(2,1,1)$ by L.Antoine (1924) and…
Two-valued sets are local sets of the two-dimensional Gaussian free field (GFF) that can be thought of as representing all points of the domain that may be connected to the boundary by a curve on which the GFF takes values only in [-a,b].…
We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…
We study the asymptotic behavior of the Hopf characteristic function of fractals and chaotic dynamical systems in the limit of large argument. The small argument behavior is determined by the moments, since the characteristic function is…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
We investigate, both analytically and numerically, the kinetic and stochastic counterpart of the triadic Cantor set. The generator that divides an interval either into three equal pieces or into three pieces randomly and remove the middle…
We consider the set of points in infinitely many max-norm annuli centred at rational points in $\mathbb R^{n}$. We give Jarn\'ik-Besicovitch type theorems for this set in terms of Hausdorff dimension. Interestingly, we find that if the…
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…
The classical powerset construction is a standard method converting a non-deterministic automaton into a deterministic one recognising the same language. Recently, the powerset construction has been lifted to a more general framework that…
In this paper, we study Basmajian-type series identities on holomorphic families of Cantor sets associated to one-dimensional complex dynamical systems. We show that the series is absolutely summable if and only if the Hausdorff dimension…
Bennett's notion of depth is usually considered to describe the usefulness and internal organization of the information encoded into an object such as an infinite binary sequence. We consider a natural way to relativize the notion of depth…
Suppose a set of prototiles allows $N$ different substitution rules. In this paper we study tilings of $\mathbb{R}^d$ constructed from random application of the substitution rules. The space of all possible tilings obtained from all…
Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…
In 1984, Kurt Mahler posed the following fundamental question: How well can irrationals in the Cantor set be approximated by rationals in the Cantor set? Towards development of such a theory, we prove a Dirichlet-type theorem for this…